What is unbounded solution in linear programming?
The solutions of a linear programming problem which is feasible can be classified as a bounded solution and an unbounded solution. The unbounded solution is a situation when the optimum feasible solution cannot be determined, instead there are infinite many solutions.
Can a linear program be unbounded?
A linear program is unbounded if it is feasible but its objective function can be made arbitrarily “good”. For example, if a linear program is a min- imization problem and unbounded, then its objective value can be made arbitrarily small while maintaining feasibility.
What is unbounded solution in graphical method?
Unbounded Solution: Graphical Method in LPP It is a solution whose objective function is infinite. If the feasible region is unbounded then one or more decision variables will increase indefinitely without violating feasibility, and the value of the objective function can be made arbitrarily large.
What is bounded solution?
consists in finding conditions upon λ under which, for each f ∈ L∞(R), (2.1) has. a unique solution u ∈ AC(R) ∩ L∞(R). We denote the usual norm of v ∈ L∞(R) by |u|∞. Such a solution is simply called a bounded solution of (2.1).
What is bounded and unbounded solution in LPP?
If the feasible region can be enclosed in a sufficiently large circle, it is called bounded; otherwise it is called unbounded. If a feasible region is empty (contains no points), then the constraints are inconsistent and the problem has no solution.
What is bounded and unbounded region in LPP?
Bounded feasible regions have both a minimum and a maximum value. Unbounded feasible regions have either a minimum or maximum value, never both. The minimum or maximum value of such objective functions always occurs at the vertex of the feasible region.
What is unbounded function?
Now, a function which is not bounded from above or below by a finite limit is called an unbounded function. For example: – x is an unbounded function as it extends from −∞ to ∞.
What is unbounded problem?
An infeasible problem is a problem that has no solution while an unbounded problem is one where the constraints do not restrict the objective function and the objective goes to infinity. Both situations often arise due to errors or shortcomings in the formulation or in the data defining the problem.
What is unbounded feasible region?
Unbounded Feasible Regions An unbounded feasible region can not be enclosed in a circle, no matter how big the circle is. If the coefficients on the objective function are all positive, then an unbounded feasible region will have a minimum but no maximum.
What is bounded region in LPP?
Bounded Region. A feasible region that can be enclosed in a circle. A bounded region will have both a maximum and minimum values. Unbounded Region. A feasible region that can not be enclosed in a circle.