Inner Approximation Algorithm for Generalized Linear Multiplicative Programming Problems

Journal of Inequalities and Applications- United Kingdom

doi 10.1186/s13660-018-1947-9

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Science and Business Media LLC

Related search

Global Optimization for Generalized Linear Multiplicative Programming Using Convex Relaxation

Mathematical Problems in Engineering
MathematicsEngineering
2018English

A Simplicial Branch and Bound Duality-Bounds Algorithm to Linear Multiplicative Programming

Journal of Applied Mathematics
Applied Mathematics
2013English

Inner Approximation Method for a Reverse Convex Programming Problem

Journal of Optimization Theory and Applications
ControlManagement ScienceApplied MathematicsOptimizationOperations Research
2000English

An Adaptive Sequential Linear Programming Algorithm for Optimal Design Problems With Probabilistic Constraints

2005English

A Global Optimization Algorithm for Generalized Quadratic Programming

Journal of Applied Mathematics
Applied Mathematics
2013English

Tight Approximation Algorithm for Connectivity Augmentation Problems

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2008English

Algorithms for Solving Non-Linear Programming Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1975English

Generalized Upper Bounded Techniques for Linear Programming - I

1964English

An Approximation Method for Solving Nonconvex Quadratic Programming Problems

Journal of Applied Sciences
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy