June 2006
Beginner
793 pages
20h 59m
English
An unbounded solution of a linear programming problem is a situation where objective function is infinite. A linear programming problem is said to have unbounded solution if its solution can be made infinitely large without violating any of its constraints in the problem. Since there is no real applied problem which has infinite return, hence an unbounded solution always represents a problem that has been incorrectly formulated. Under the Simplex Method, an unbounded solution is indicated when there are no positive values of Replacement Ratio i.e. Replacement ratio values are either infinite or negative. In this case there is no outgoing variable.
Read now
Unlock full access