On subsidiary problems in geometric programming
From MaRDI portal
Publication:1206603
DOI10.1016/0377-2217(92)90058-HzbMath0770.90054MaRDI QIDQ1206603
Dennis L. Bricker, Jayant Rajgopal
Publication date: 1 April 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(92)90058-h
column generation; dual-based procedure; generalized linear program; inactive constraints; subsidiary problems
90C30: Nonlinear programming
Cites Work
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- Controlled dual perturbations for posynomial programs
- Dual to primal conversion in geometric programming
- Posynomial geometric programming as a special case of semi-infinite linear programming
- A modified convace simplex algorithm for geometric programming
- A Linear Programming Approach to the Chemical Equilibrium Problem
- On a classification scheme for geometric programming and complementarity theorems††
- A linear programming approach to geometric programs
- Convergence Conditions for Nonlinear Programming Algorithms
- Linearizing Geometric Programs
- Unnamed Item
- Unnamed Item
- Unnamed Item