|
Course
Description
Linear
programming formulation of optimization problems, hyperplanes,
convex sets, linear independence, bases of vector spaces,
matrix inversion, theory and computation techniques of simplex,
revised simplex methods, degeneracy, duality. Transportation
and assignment problems, integer programming and network flows.
Prerequisites
3
lecture hours
3 semester hours
|
