Abstract
The relationships between multiple optimal dual solutions of a convex programming problem and the corresponding primal optimal value function are established by straightforward arguments on known results in duality theory. The subsequent discussion includes a demonstration that one-sided shadow prices can be found by solving a linear programming problem, conditions for the uniqueness and validity of the classical shadow price interpretation and a specialization of the results to the linear programming case.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
