Scribd
Upload
73 views5 pages

Graphical Solution Methodspart2

This document discusses three types of design problems: 1) Problems with multiple solutions, where one constraint is parallel to the cost function, resulting in multiple optimal designs along that constraint line. 2) Problems with unbounded solutions, where the feasible set is not bounded, meaning there is no finite optimal solution and the problem formulation needs reexamination. 3) Infeasible problems, where the constraints conflict such that there is no feasible region satisfying all constraints, making the problem impossible to solve as stated. The document provides examples to illustrate each type of problem.

Uploaded by

Usama Epn Abdelmksoud Ahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
73 views5 pages

Graphical Solution Methodspart2

This document discusses three types of design problems: 1) Problems with multiple solutions, where one constraint is parallel to the cost function, resulting in multiple optimal designs along that constraint line. 2) Problems with unbounded solutions, where the feasible set is not bounded, meaning there is no finite optimal solution and the problem formulation needs reexamination. 3) Infeasible problems, where the constraints conflict such that there is no feasible region satisfying all constraints, making the problem impossible to solve as stated. The document provides examples to illustrate each type of problem.

Uploaded by

Usama Epn Abdelmksoud Ahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Mansoura University

Faculty of Engineering

Graphical solution methods


Part two

Prepared by
Eng. /Adel Osama Abd Elmaksoud Ahmed
Student in master level 600

Supervision of
Dr. / Mohamed Taher Eleraky
Contents

1. Design problems with multiple solutions

2. Design problem with unbounded solutions

3. Infeasible design problem

PAGE 1
1.Design problem with multiple solutions
A situation can arise in which a constraint is parallel to the cost function. If
that constraint is active at the optimum, there are multiple solutions to the
problem. To illustrate this situation, consider the following design problem
written in the standard form:
Minimize
f (x) = − x1 − 0.5x2 (a)
subject to
2x1 + 3x2 ≤ 12, 2x1 + x2 ≤ 8, − x1 ≤ 0, − x2 ≤ 0 (b)

In this problem, the second constraint is parallel to the cost function.


Therefore, there is a possibility of multiple optimum designs. Fig. 3.7
provides a graphical solution to the problem. It is seen that any point on
the line B–C gives an optimum design, giving the problem infinite
optimum solutions.

PAGE 2
2.Design problem with unbounded solution
Some design problems may not have a bounded solution. This situation
can arise if we forget a constraint or incorrectly formulate the problem. To
illustrate such a situation, consider the following design problem:
Minimize
f (x) = − x1 + 2x2 (c)
subject to
−2x1 + x2 ≤ 0, − 2x1 + 3x2 ≤ 6, − x1 ≤ 0, − x2 ≤0 (d)
The feasible set for the problem is shown in Fig. 3.8 along with several cost
function contours. It is seen that the feasible set is unbounded. The trend
of the cost function contours shows that there is no finite optimum
solution, and we must reexamine the way the problem was formulated to
correct the situation. Fig. 3.8 shows that the problem is under constrained.
It is important to note, however, that some problems with unbounded
feasible set can have a finite optimum point. This depends on the form of
the cost function.

PAGE 3
3.infeasible design problem
If we are not careful in formulating it, a design problem may not have any
feasible solution, which happens when there are conflicting requirements
or inconsistent constraint equations. There may also be no solution when
we put too many constraints on the system; that is, the constraints are so
restrictive that no feasible solution is possible. These are called infeasible
problems. To illustrate them, consider the following:
Minimize
f (x) = x1 + 2x2 (e)

subject to

3x1 + 2x2 ≤6, 2x1 + 3x2 ≥12, x1 , x2 ≤5, x1 , x2 ≥ 0 (f )

Constraints for the problem are plotted in Fig. 3.9 and their infeasible side
is shaded out. It is evident that there is no region within the design space
that satisfies all constraints; that is, there is no feasible region for the
problem. Thus, the problem is infeasible. Basically, the first two constraints
impose conflicting requirements. The first requires the feasible design to be
below the line A–G, whereas the second requires it to be above the line C –
F. Since the two lines do not intersect in the first quadrant, the problem
has no feasible region. The problem formulation needs to be reexamined
and adjusted so that there is a feasible region for the problem.

PAGE 4

You might also like