The complementary unboundedness of dual feasible solution sets in convex programming

DOI10.1007/BF01593806zbMath0363.90090MaRDI QIDQ4138493

Elmor L. Peterson

Publication date: 1977

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20)

Related Items (1)

Clark's theorem for semi-infinite convex programs

Cites Work

• Unnamed Item
• Lagrange multipliers and nonlinear programming
• Duality and stability in extremum problems involving convex functions
• Boundedness relations for linear constraint sets
• On the primal and dual constraint sets in geometric programming
• Dual Programs and Minimum Cost
• Remark on the Constraint Sets in Linear Programming
• A duality theorem for non-linear programming
• Geometric Programming
• Convex Analysis
• Complementarity Theorems for Linear Programming
• Symmetric Duality for Generalized Unconstrained Geometric Programming

This page was built for publication: The complementary unboundedness of dual feasible solution sets in convex programming