Title: Numerical Solution of LP Problems Using the Simplex Method
Abstract:The chapter aims to introduce completely the theory behind the simplex method for Linear Programming, by building slowly the material from the solution set of rectangular linear (affine) systems of eq...The chapter aims to introduce completely the theory behind the simplex method for Linear Programming, by building slowly the material from the solution set of rectangular linear (affine) systems of equations to vertex solutions. The simplex method is introduced as a natural way to progress from one vertex to the next, on the constraint polytope, always improving the objective until the optimal solution is reached. Use of artificial variables and the two-phase simplex method is made to deal with finding an initial feasible basis for the simplex method. Pathological cases of LP problems are also considered, and how the simplex method would detect them is highlighted.Read More
Publication Year: 2020
Publication Date: 2020-11-30
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot