The complementary unboundedness of dual feasible solution sets in convex programming
- 1 December 1977
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 12 (1) , 392-405
- https://doi.org/10.1007/bf01593806
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Geometric ProgrammingSIAM Review, 1976
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- On the primal and dual constraint sets in geometric programmingJournal of Mathematical Analysis and Applications, 1970
- Symmetric Duality for Generalized Unconstrained Geometric ProgrammingSIAM Journal on Applied Mathematics, 1970
- Boundedness relations for linear constraint setsLinear Algebra and its Applications, 1970
- Complementarity Theorems for Linear ProgrammingSIAM Review, 1970
- Lagrange multipliers and nonlinear programmingJournal of Mathematical Analysis and Applications, 1967
- Duality and stability in extremum problems involving convex functionsPacific Journal of Mathematics, 1967
- Dual Programs and Minimum CostJournal of the Society for Industrial and Applied Mathematics, 1962
- Remark on the Constraint Sets in Linear ProgrammingThe American Mathematical Monthly, 1961