Abstract

Basing on a suitable geometric interpretation for a pair of dual problems the author performs a proof the duality- theoreirl in :ingar programming.Besides of simple notions and auxiliary means being necessary for the proof the separation theorem for convex sets is the only profounded result used in demonstrating the main theorem.

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 call

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.