The essence of Operations Research. Introduction to linear programming
Linear programming problem. Foundations of the simplex method.
The Big M method. Sensitivity analysis.
Duality in linear programming; complementary slackness theorem.
Modeling decision problems with integer variables. Branch-and-bound method.
The transportation problem.
Selected extensions of linear programming including goal programming.
Introduction to dynamic programming with examples.
Laboratory: Extensions of linear programming - examples with applications
Laboratory: Integer linear programming - examples with applications
Laboratory: Transportation problem - the streamlined simplex method, balancing out.
Laboratory: Selected extensions of transportation problem - fixed charge problem, empty runs, time minimization
Laboratory: Network optimization models I - maximal flow problem, minimum spanning tree.
Laboratory: Network optimization models II - shortest path problem, minimum cost flow problem.
Laboratory: Assessment of efficient units using data envelopment analysis.
|