Scribd
Upload
40 views

Graphical Solution Methods

Graphical solution methods can be used to solve optimization problems with two design variables. The problem involves maximizing profit from manufacturing two products. [1] The feasible region satisfying all constraints is identified on a graph of the design variables. [2] Contours of the objective function are plotted within the feasible region. [3] The optimum solution occurs where the highest objective function contour is tangent to the feasible region, identified here as manufacturing 4 units of product A and 12 units of product B for maximum daily profit of $8,800.

Uploaded by

Usama Epn Abdelmksoud Ahmed
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
40 views

Graphical Solution Methods

Graphical solution methods can be used to solve optimization problems with two design variables. The problem involves maximizing profit from manufacturing two products. [1] The feasible region satisfying all constraints is identified on a graph of the design variables. [2] Contours of the objective function are plotted within the feasible region. [3] The optimum solution occurs where the highest objective function contour is tangent to the feasible region, identified here as manufacturing 4 units of product A and 12 units of product B for maximum daily profit of $8,800.

Uploaded by

Usama Epn Abdelmksoud Ahmed
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Mansoura University

Faculty of Engineering

Graphical solution methods


Part one

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

Supervision of
Dr. / Mohamed Taher Eleraky
Contents

1. Introduction

2. Graphical solution process

i. Profit maximization problem formulation

ii. Graphical solution procedure

iii. Solve the problem using excel

PAGE 1
1.introduction
Optimization problems having only two design variables can be solved by
observing how they are graphically represented. All constraint functions
are plotted, and a set of feasible solutions (the feasible set) for the
problem is identified. Objective function contours are then drawn, and
the optimum design is determined by visual inspection.
2.Graphical solution process
i. Profit maximization problem formulation:-
Step one-problem description:-
A company manufactures two machines, A and B. Using available resources, either
28 A or 14 B can be manufactured daily. The sales department can sell up to 14 A
machines or 24 B machines. The shipping facility can handle no more than 16
machines per day. The company makes a profit of $400 on each A machine and
$600 on each B machine. H ow many A and B machines should the company
manufacture every day to maximize its profit?

Step two-Data & information collection:-


Data and information are defined in the project
Step three-Definition of design variables:-
X1 = number of A machines manufactured each day
X2 = number of B machines manufactured each day

Step four-Optimization criterion:-

The objective is to maximize daily profit, which can be expressed in

terms of design variables using the data given in step 1 as:

P = 400x1 + 600x2 , $

PAGE 2
Step five-Formulation of constrains:-
Design constraints are placed on manufacturing capacity,on sales personnel, and

on the shipping and handling facility. The constraint on the shipping and handling

facility is quite straight forward:

x1 + x2 ≤ 16 (shipping and handling constraint)

(manufacturing constraint)

(limitation on sale department)

x1 , x2 ≥ 0

Step six-Mathematical formulation:-


Note that for this problem, the formulation remains valid even when a design variable

has zero value. The optimization problem is to find two design variables xl and x2 to

maximize the profit function in Eq. (a) subject to five inequality constraints .All functions

of the problem are linear in variables xl and x2. Therefore, it is a linear programming

problem. Note also that for a meaningful solution, both design variables must have

integer values at the optimum point.

PAGE 3
ii. Graphical solution procedure:-

Step1:- coordinate system set- up

Step2:-inequality constraint boundary plot(fig 3.1)

PAGE 4
Step3:- identification of feasible region for inequality(test-
point)-fig3.2.

Step4:- identification of feasible region


By following the procedure that is described in step 3, all inequalities are plotted
on the graph and the feasible side of each one is identified (if equality constraints
were present, they would also be plotted at this stage). Note that the constraints
x1, x2 ≥ 0 restrict the feasible region to the first quadrant of the coordinate system.
The intersection of feasible regions for all constraints provides the feasible region
for the profit maximization problem, indicated as ABCDE in Fig. 3.3. . Any point in
this region or on its boundary provides a feasible solution to the problem.

PAGE 5
Step5:- plotting of objective contours:-
A contour is a curve on the graph that connects all points having the same
objective function value. A collection of points on a contour is also called the level
set. If the objective function is to be minimized, the contours are also called
isocost curves. To plot a contour through the feasible region, we need to assign it
a value. To obtain this value, select a convenient point in the feasible region and
evaluate the profit function there. For example, at point (6,4), the profit function is
calculated as P = 6 × 400 + 4 × 600 = 4800. To plot the P = 4800 contour, we
plot the function 400x1 + 600x2 = 4800. This contour is a= straight line, as shown
in Fig. 3.4.

Note: To plot an objective function contour through the feasible region, select a
convenient point in the feasible set. Evaluate the objective function at the selected
point. Assign this as the contour value and plot the objective function equation.

PAGE 6
Step6:- identification of optimum solution:-
To locate an optimum point for the objective function, we need at least two contours that
pass through the feasible region. We can then observe the trend for values of the
objective function at different feasible points to locate the best solution point. Contours for
P = 2400, 4800, and 7200 are plotted in Fig. 3.5. We now observe the following trend: As
the contours move up toward point D, feasible designs can be found with larger values
for P. It is seen from this observation that point D has the largest value for P in the
feasible region. We now simply read the coordinates of point D (4,12) to obtain the
optimum design, having a maximum value for the profit function as P = 8800. Note that
the point C or E is not the maximum point for the profit function because we can move
from there towards point D and increase the function value further from C or E.
Note that the optimum solution report consists of design variable values, objective
function value, and a list of active/inactive constraints.

PAGE 7
iii. Solve the problem using excel:-
By solving the problem by excel solver we find that (4.12) is
optimum solution for the problem with profit 8800.
graphical solution.xlsx.

PAGE 8

You might also like