1: The following statements are true except for ...
2: What method would you use to maximize the function:
subject to the constraints:
where all variables are non-negative?
3: What is the starting point for the Karmarkar's projective algorithm in n dimensions?
n
x0 = 0
0
x0 = 1/n
1
x0 = en/n
en
xn
x0 = e1
e1
x1
4: Identify entering and departing variables for the next iteration of the dual simplex method.
x2
x3
x4
x5
z
5: Suppose you have found an optimal solution with the value z = z0 in the problem of minimization of z = c x, subject to the constraints
z = z0
z = c x
If a new variable x' >= 0 is added to the problem, what may happen to the optimal objective function value z0?
x' >= 0
z0
x'
Your Results: