| Faculty of Science|
Department of Mathematics
| Course Archive 2010-2011|
MATH 340 / 921
Introduction to Linear Programming
|Office:||West Mall Annex, Room 107|
|Class schedule:||Tue Thu Fri<br\>14:00 - 16:00|
|Office hours:|| Mon 14:00 - 16:00|
Fri 16:00 - 17:00
standard form of LP problem
objective function of LP is
feasible solutions of LP are
optimal solution maximizing or minimizing the objective function and the value of the objective function at an optimal solution is an optimal value
infeasible LP is the one without a feasible solution, i.e. the polytope defined by the equalities and inequalities is the empty set.
unbounded LP is the one that it's corresponding polytope is unbounded.
Note: optimal values occur at the vertices of the polytope, i.e. at the extremal points or at points at infinity.
slack variables of the inequality is and the old variables are called decision variables.