Linear Programming 15: Basic feasible solutions - Algebra

preview_player
Показать описание
Linear Programming 15: Basic feasible solutions - Algebra

Abstract: We will give an algebraic description of basic feasible solutions to a linear programming problem. Basic feasible solutions are a key building block of the simplex method.

This video accompanies the class "Linear Programming and Network Flows" at Colorado State University

We are following the book "Understanding and Using Linear Programming" by Jiří Matoušek and Bernd Gärtner

Our course notes are available at
Рекомендации по теме
Комментарии
Автор

Great explanation, thanks! Can you also explain how to find a basic feasible solution, given an arbitrary feasible solution?

erelsgl