(in Polish) Optymalizacja liniowa 1000-135OPL
inear programming problems. Some examples.
The simplex tableau . Basic feasible solutions . Optimal basic solutions.
The simplex methods : the simplex algorithm , the two phase simplex algorithm , the big-M method,
the dual simplex algorithm .
Geometry of linear programming .
Duality in linear programming. The duality theorems.
Transportation problems.
Depending on time, we will also look at some related problems/techniques: network flows, integer programming
Type of course
Course coordinators
Bibliography
M.S. Bazaraa, J.J. Jarvis, H.D. Sherali, Linear Programming and Network Flows. John Wiley and Sons, 1990.
Additional information
Information on level of this course, year of study and semester when the course unit is delivered, types and amount of class hours - can be found in course structure diagrams of apropriate study programmes. This course is related to the following study programmes:
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: