Consider a maximization problem Z = x1 + 3x2 subject to: 2x1 − x2 ≤ −1;

Question

x1 + x2 = 3; x2 ≤ 1; and x1, x2 ≥ 0. Solving this linear problem would involves
(....................) and (.................) whereby the first phase will consist of checking
whether the (......................) can be reduced to zero, to proceed to second Phase.
1 (1 slack variable and 1 surplus variable); (two artificial variables); (primal
objective function)
2 (1 slack variable and 1 surplus variable); (three artificial variables); (artificial
objective function)
3 (2 slack variables and 1 surplus variable); (two artificial variables); (dual objective
function)
4 (1 slack variable and 1 surplus variable); (two artificial variables); (artificial
objective function)
5 (1 slack variable and 1 surplus variable); (two artificial variables); (dual objective
function)
Dr. Habyarimana Jean Baptiste, PhD
AST3231 Operations Research – Topic 2 – Linear P

Answer 1

4 (1 slack variable and 1 surplus variable); (two artificial variables); (artificial objective function)