Chapter 4.4, Problem 7P

Explanation of Solution

Linear programming problem

• A linear program in standard region $\text{S}$ and constraints $\text{Ax = b}$ and $\text{x >= 0}$ is considered.
• The linear program has $\text{n}$ variables and a non zero vector $\text{d}$ is the direction of unboundness.
• If the point is in the linear program’s feasible region, then in the direction d the point can be moved remaining in the feasible region.
• Consider a linear program in standard form, having basic feasible solution $\text{b1, b2,}\mathrm{}$