An elementary proof of optimality conditions for linear programming
Abstract: We give an elementary proof of optimality conditions for linear programming. The proof is direct, built on a straightforward classical perturbation of the constraints, and does not require either the use of Farkas' lemma or the use of the simplex method.
Keywords: linear programming, optimality conditions
Category 1: Linear, Cone and Semidefinite Programming (Linear Programming )
Citation: Technical Report TRITA-MAT-2008-OS6, Department of Mathematics, Royal Institute of Technology (KTH), SE-100 44 Stockholm, Sweden, June 2008.
Entry Submitted: 06/30/2008
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|