Solving Linear Programming Problems by Reducing to the Form with an Obvious Answer

DOI10.18255/1818-1015-2021-4-434-451zbMath1503.90068OpenAlexW4200359667MaRDI QIDQ5870865

G. D. Stepanov

Publication date: 24 January 2023

Published in: Modeling and Analysis of Information Systems (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mais761

zbMATH Keywords

linear programmingsimplex methodGauss methodsystems of linear equationsnon-negative solutionFarkas lemmachoice ruleLPP matrixresolving element

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on Jordan elimination, linear programming and Tchebyscheff approximation
• New approach to Farkas' theorem of the alternative
• New Finite Pivoting Rules for the Simplex Method
• Optimality and Degeneracy in Linear Programming
• A Simple Algorithm for Finding a Non-negative Basic Solution of a System of Linear Algebraic Equations

This page was built for publication: Solving Linear Programming Problems by Reducing to the Form with an Obvious Answer