Abstract
This chapter presents an algebraic approach of linear programming. The important algebraic technique, called the simplex method, for solving linear programming problems is applicable only when a linear programming problem satisfies certain conditions. The chapter discusses a simplified version of these conditions and certain other preliminaries. The chapter explains that a standard linear programming problem can be reformulated as a problem concerned with systems of equations rather than inequalities. The simplex method enables to solve the new problem with slack variables. In applied problems, the slack variables have physical interpretations. The solutions of a standard linear programming problem can be found by considering the basic feasible solutions of the new problem. The new problem with slack variables has a solution in which at least two of the variables have value zero.
Published Version
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