Homepage › Solution manuals › Dimitris Bertsimas › Introduction to Linear Optimization › Exercise 3.19
Exercise 3.19
While solving a standard form problem, we arrive at the following tableau, with , and being the basic variables:
The entries in the tableau are unknown parameters. For each one of the following statements, find some parameter values that will make the statement true.
- (a)
- The current solution is optimal and there are multiple optimal solutions.
- (b)
- The optimal cost is .
- (c)
- The current solution is feasible but not optimal.
Answers
- (a)
- We take the following facts into account.
First, the current solution is optimal, yet the reduced cost is negative. By Theorem 3.1(b), the current solution cannot be nondegenerate. In other words, by Definition 2.11.
Secondly, in the next iteration, we can choose the second column to enter the basis. If we do so, we stay in the same basic feasible solution only have changed the basis as (cf. page 92). We want, however, the new basis to be optimal; thus, we must impose in the resulting tableau.
Finally, we do not want this solution to be unique, i.e., we fix and . Thus, we can move in a positive direction (since and ) without changing the optimal cost (since ).
A possible choice of values is represented through the following tableau:
-10 0 -2 0 0 0 4 -1 2 1 0 0 1 1 -4 0 1 0 0 0 3 0 0 1 - (b)
- For the tableau to represent a feasible solution, we must demand
.
Furthermore, recall that the problem is declared unbounded if no
components of an exiting column are positive; accordingly, set
for the first column to qualify as an exiting one, and set
for the
values of
to result in nonpositive values. A possible example is:
-10 -1 -2 0 0 0 4 -1 -1 1 0 0 1 -1 -4 0 1 0 1 -1 3 0 0 1 - (c)
- For the tableau to represent a feasible solution, we must demand
.
Since the second column has a negative reduced cost, moving in the direction of
will result in a better result, i.e., the current cost is not optimal.
-10 2 -2 0 0 0 4 -1 1 1 0 0 1 1 -4 0 1 0 1 1 3 0 0 1