On the Interpretation of Optimal Dual Solutions in Convex Programming

DOI10.2307/2581171zbMATH Open0531.90079OpenAlexW4235121842MaRDI QIDQ3313634FDOQ3313634

Authors: Reiner Horst 

Publication date: 1984

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2581171

Recommendations

• scientific article; zbMATH DE number 4045485
• A Note on Shadow Prices in Linear Programming
• Discussion on the solution and judgment of the shadow price in linear programming
• Optimal system design: Towards new interpretation of shadow prices in linear programming
• scientific article; zbMATH DE number 7358904

zbMATH Keywords

equilibrium pricesmultiple optimal dual solutionsone-sided shadow pricesprimal optimal value function

Mathematics Subject Classification ID

Convex programming (90C25) Microeconomic theory (price theory and economic markets) (91B24) Duality theory (optimization) (49N15)

Cited In (8)

• Title not available (Why is that?)
• Finding a strict feasible dual solution of a convex optimization problem
• Structure and interpretation of dual-feasible functions
• Discussion on the solution and judgment of the shadow price in linear programming
• Title not available (Why is that?)
• Optimal system design: Towards new interpretation of shadow prices in linear programming
• Graphical analysis of duality and the Kuhn-Tucker conditions in linear programming
• Support prices of activities in linear programming¹,²

This page was built for publication: On the Interpretation of Optimal Dual Solutions in Convex Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3313634)