Abstract
A constructive and elementary proof of the duality theorem of linear programming is presented. The proof utilizes the new concept of an embedded core program, which is a program generated from a linear program with finite optimum by successively removing constraints until no remaining constraints can be deleted without changing the optimal solution.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
