Scribd
Upload
343 views

Special Cases of Linear Programming Models (Part 3)

This document discusses special cases that can occur in linear programming models: 1. A model can have multiple optimal solutions, where more than one combination of variables achieves the same optimal value of the objective function. For example, a model could have two corner point solutions that both yield the maximum possible profit. 2. A model is said to have an unbounded optimal solution if the feasible region is unbounded and the objective function value continually increases in the direction of unboundedness. This typically indicates a mistake in the model formulation. 3. A model could be infeasible if no solution satisfies all the constraints simultaneously. For example, two constraints could define regions that do not overlap at all, leaving no

Uploaded by

Kyla Renz de Leon
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
343 views

Special Cases of Linear Programming Models (Part 3)

This document discusses special cases that can occur in linear programming models: 1. A model can have multiple optimal solutions, where more than one combination of variables achieves the same optimal value of the objective function. For example, a model could have two corner point solutions that both yield the maximum possible profit. 2. A model is said to have an unbounded optimal solution if the feasible region is unbounded and the objective function value continually increases in the direction of unboundedness. This typically indicates a mistake in the model formulation. 3. A model could be infeasible if no solution satisfies all the constraints simultaneously. For example, two constraints could define regions that do not overlap at all, leaving no

Uploaded by

Kyla Renz de Leon
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

SPECIAL CASES OF LINEAR PROGRAMMING MODELS

Only one optimal solution has been attained in the production problem of ABC, Inc. It is a distinctive in
most cases linear programming problems. Figure 2.12 express the feasible area together with the objective
function z (the arrow specifies the improvement directions of the objective value). Unique optimal solution
is the corner point A.

In the previous discussion, let’s assume that the price


of the car is 650 (instead of 550), the management of
ABC, Inc. has two basic possibilities how to optimize
the profit. Producing 1000 cars (and 2000 boats) or
2000 cars (and 1000 boats) would bring the identical
optimal profit 1,650,000.
A linear programming problem with two or more
optimal solutions is said to have alternative (or
multiple) optimal solutions.

This condition occurs in graphical depiction of the


model when the objective function line is parallel to the
borderline of one constraint, as can be shown in Figure
2.13. Because the objective function reflects the
isoprofit line (in case of maximization) or the isocost
line (in case of minimization), all the solutions at the
edge of the feasible area have the same objective value
(optimal). There are two optimal corner points (B and
C) and the infinite number of optimal points on line
segment BC.

Figure 2.14 shows an interesting alternative of just


described case. The difference is evident – the feasible
area is unbounded and there is only one optimal corner
point D; the other optimal points lie on the borderline
running to infinity.
There is no optimal solution if the feasible solution area
is unbounded and the objective value is being enhanced
in the direction of unboundedness, therefore, the optimal
solution is endless (see Figure 2.15). Since these
instances are uncommon in reality, this finding typically
indicates mistake in formulation.

Infeasibility exists when no solution meets any of the


constraints. There is no common feasible area (no
feasible solution) in case of two constraints graphed in
Figure 2.16. In reality this scenario sometimes occurs,
particularly if the manager wants to be too accurate in
model formulation. In order to remove the infeasibility,
the model must be simplifying by for example
eliminating any vain restrictions.
While the two-variable model is not popular in practice
and is used more for analytical purposes, for
multidimensional problems both theories may be
simplified and transformed.

You might also like