On a classification scheme for geometric programming and complementarity theorems††
From MaRDI portal
Publication:4143032
Cites work
- Classifying convex extremum problems over linear topologies having separation properties
- Constraint Sets of Geometric Programs Characterized by Auxiliary Problems
- Convex analysis treated by linear programming
- Duality and asymptotic solvability over cones
- Duality Theory for Geometric Programming
- Linearizing Geometric Programs
- On the primal and dual constraint sets in geometric programming
- Solution Sets of Convex Programs Related to Chemical Equilibrium Problems
- Symmetric Duality for Generalized Unconstrained Geometric Programming
- Theorems on the dimensions of convex sets
Cited in
(8)- An alternative approach to the refined duality theory of geometric programming
- On subsidiary problems in geometric programming
- On geometric programming problems having negative degrees of difficulty
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- On a compound duality classification for geometric programming
- Classifying convex extremum problems over linear topologies having separation properties
- On controlling the parameter in the logarithmic barrier term for convex programming problems
- A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
This page was built for publication: On a classification scheme for geometric programming and complementarity theorems††
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4143032)
