Homework Statement
"There exists an implementation of the simplex algorithm that avoids cycling. (If your
answer is `yes', describe the strategy; if your answer is `no' give an example and explain
briefly why every strategy must fail.)"
The Attempt at a Solution
We normally do the...
Ah I see! So essentially, the slack variables w_i are negative when we proceed with the simplex which means that we can't actually run the simplex algorithm because we do not have an initial basic feasible solution. Is this correct?
Hello everyone, I hope I've posted in the right section!
I have the following linear program. All I've done is added my slack variables (w) and made each constraint the subject, as you do.
\mathrm{maximize} \ z=x_1+3x_2 \
w_1 = -3 + x_1 + x_2 \\
w_2 = -1 + x_1 - x_2 \\
w_3 = 4 - x_1 -2x_2...