This course is not currently conducted!
Erasmus code: 11.9
ISCED code: 0619
ECTS credits:
unknown
Language:
Polish
Organized by:
Faculty of Mathematics, Informatics, and Mechanics
Optimization I 1000-134OP1
Linear 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
elective courses
Bibliography
M.S. Bazaraa, J.J. Jarvis, H.D. Sherali, Linear Programming and Network Flows. John Wiley and Sons, 1990.
Additional information
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: