Abstract
Abstract : Tucker has formulated the Duality Theorem of Linear Programming in terms of orthogonality properties of a pair of complementary orthogonal linear manifolds with respect to the positive orthant. This theorem is generalized by substituting complementary polar conical sets for complementary orthogonal linear manifolds, and proved under simple stability assumptions. Equivalence to Feuchel's Duality Theorem for conjugate convex functions is established. There are strong parallelisms to work by Kretschmer. (Author)
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 callMore From: Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences
Disclaimer: 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.
