On a classification scheme for geometric programming and complementarity theorems††

DOI10.1080/00036817608839138zbMath0366.90104OpenAlexW2002223274WikidataQ58297471 ScholiaQ58297471MaRDI QIDQ4143032

No author found.

Publication date: 1976

Published in: Applicable Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00036817608839138

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

On controlling the parameter in the logarithmic barrier term for convex programming problems ⋮ An infeasible interior-point algorithm for solving primal and dual geometric programs ⋮ A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier ⋮ On a compound duality classification for geometric programming ⋮ An alternative approach to the refined duality theory of geometric programming ⋮ On subsidiary problems in geometric programming ⋮ Classifying convex extremum problems over linear topologies having separation properties ⋮ On geometric programming problems having negative degrees of difficulty

Cites Work

• Theorems on the dimensions of convex sets
• Classifying convex extremum problems over linear topologies having separation properties
• On the primal and dual constraint sets in geometric programming
• Constraint Sets of Geometric Programs Characterized by Auxiliary Problems
• Duality and asymptotic solvability over cones
• Duality Theory for Geometric Programming
• Symmetric Duality for Generalized Unconstrained Geometric Programming
• Linearizing Geometric Programs
• Solution Sets of Convex Programs Related to Chemical Equilibrium Problems
• Convex analysis treated by linear programming

This page was built for publication: On a classification scheme for geometric programming and complementarity theorems†^†