UNBOUNDED SOLUTION
An unbounded solution of a linear programming problem is a solution whose 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 the constraints in the problem. Since there is no real applied problem which has infinite returns, hence an unbounded solution always represents a problem that has been incorrectly formulated.
For example, in a maximization problem at least one of the constraints must be an 'equality' or 'less than or equal to' (≤) type. If all of the constraints are 'greater than or equal to' (≥) type, then there will be no upper limit on the feasible region. Similarly for minimization problem, at least ...
Get Quantitative Techniques: Theory and Problems now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
