On equating the difference between optimal and marginal values of general convex programs

DOI10.1007/BF00935176zbMath0422.90064MaRDI QIDQ1134005

S. H. Smith

Publication date: 1981

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

nonstandard analysisgeneralized convex programsmarginal value equationpolynomial Kuhn- Tucker vectorspolynomial subgradients

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (3)

Lexocographic multipliers ⋮ A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier ⋮ Strong duality for standard convex programs

Cites Work

• On semi-infinite systems of linear inequalities
• The Dual in Nonlinear Programming and Its Economic Interpretation
• Convex Analysis
• Non-standard analysis

This page was built for publication: On equating the difference between optimal and marginal values of general convex programs