A Simpler Approach to Linear Programming
Discrete Mathematics
2019-08-23 v2 Optimization and Control
Abstract
Dantzig and Eaves claimed that fundamental duality theorems of linear programming were a trivial consequence of Fourier elimination. Another property of Fourier elimination is considered here, regarding the existence of implicit equalities rather than solvability. This leads to a different interpretation of duality theory which allows us to use Gaussian elimination to decide solvability of systems of linear inequalities, for bounded systems.
Cite
@article{arxiv.1907.07811,
title = {A Simpler Approach to Linear Programming},
author = {Jean-Louis Lassez},
journal= {arXiv preprint arXiv:1907.07811},
year = {2019}
}