Description
Linear programming problems; simplex method, upper bounded variables, free variables; duality; postoptimality analysis; linear programs having special structures; integer programming problems; unimodularity; knapsack problem.
Reference text in its original language
Linear programming problems; simplex method, upper bounded variables, free variables; duality; postoptimality analysis; linear programs having special structures; integer programming problems; unimodularity; knapsack problem.
Sources and references
Dates and sources are retained to help you verify the information. Translations are provided to facilitate reading; the official source governs conditions and requirements.
Source reference : https://calendar.carleton.ca/grad/courses/MATH/