Report # 1

Topic: Graphical Approach

Name

Muhammad Ali

REG NO

BChE-FA19-016

Subject

P&O Management

Submitted To

Sir Ahmed Saleem

Department Of Chemical Engineering

Table of Contents
1. Graphical linear programming......................................1
1.1. Outline of graphical procedure..................................1
1.1.1. Formulate the LP (Linear programming) problem. .1
1.1.2. Construct a graph and plot the constraint lines......1
1.1.3. Determine the valid side of each constraint line....1
1.1.4. Identify the feasible solution region.......................1
1.1.5. Plot the objective function on the graph................1
1.1.6. Find the optimum point..........................................1
1.2. Problem......................................................................2
1. Graphical linear programming
Graphical method, or Geometric method, allows solving simple linear programming problems
intuitively and visually. This method is limited to two or three problems decision variables since
it is not possible to graphically illustrate more than 3D.

1.1. Outline of graphical procedure

The general procedure followed in graphical approach is:

1.1.1. Formulate the LP (Linear programming) problem

We have already understood the mathematical formulation of an LP problem in a previous
section. Note that this is the most crucial step as all the subsequent steps depend on our
analysis here.

1.1.2. Construct a graph and plot the constraint lines

The graph must be constructed in ‘n’ dimensions, where ‘n’ is the number of decision variables.
This should give you an idea about the complexity of this step if the number of decision
variables increases.
One must know that one cannot imagine more than 3-dimensions anyway! The constraint lines
can be constructed by joining the horizontal and vertical intercepts found from each constraint
equation.

1.1.3. Determine the valid side of each constraint line

This is used to determine the domain of the available space, which can result in a feasible
solution. How to check? A simple method is to put the coordinates of the origin (0,0) in the
problem and determine whether the objective function takes on a physical solution or not. If
yes, then the side of the constraint lines on which the origin lies is the valid side. Otherwise it
lies on the opposite one.

1.1.4. Identify the feasible solution region

The feasible solution region on the graph is the one which is satisfied by all the constraints. It
could be viewed as the intersection of the valid regions of each constraint line as well. Choosing
any point in this area would result in a valid solution for our objective function.

1.1.5. Plot the objective function on the graph

It will clearly be a straight line since we are dealing with linear equations here. One must be
sure to draw it differently from the constraint lines to avoid confusion. Choose the constant
value in the equation of the objective function randomly, just to make it clearly distinguishable.

1.1.6. Find the optimum point

An optimum point always lies on one of the corners of the feasible region. How to find it? Place
a ruler on the graph sheet, parallel to the objective function. Be sure to keep the orientation of

1
this ruler fixed in space. We only need the direction of the straight line of the objective
function. Now begin from the far corner of the graph and tend to slide it towards the origin.

If the goal is to minimize the objective function, find the point of contact of the ruler with the
feasible region, which is the closest to the origin. This is the optimum point for minimizing the
function.
If the goal is to maximize the objective function, find the point of contact of the ruler with the
feasible region, which is the farthest from the origin. This is the optimum point for maximizing
the function.

1.2. Problem
Two products can be produced on a certain machine. There are 12 hours of machine time
available to produce these products. Product 1 requires 1 hour per unit, and product 2 requires
material per unit. Both products require one raw material: product 1 uses 4 pounds of raw
material per unit, and product 2 uses 3 pounds. There are 24 pounds of this raw material. If the
goal is to maximize the profit from these two products and product 1 contribute $4 per unit to
profit and product 2 contributes $5 per unit, what quantity of each should produced?
To solve this problem, we must first set it up in mathematical format. This involves the
following:
1. Identify the decision variables. In this case, they are x1 = quantity of product 1 and x2 =
quantity of product 2.
2. Formulate the objective function. It is
Maximize Z = 4x1 + 5x2
3. Identify and formulate the constraints. These are two constraints machine time and raw
material. The constraints are
Machine time x1 + 3x2 ≤ 12
Raw material 4x1 +3x2 ≤ 24
4. Add nonnegative constraints. They are x1,x2 ≥ 0, thus the model is
Maximize Z= 4x1 + 5x2
Subject to
Machine time x1 + 3x2 ≤ 12
Raw material 4x1 + 3x2 ≤ 24
X1, X2 ≥ 0
The next step is to plot the constraints.

2
 Plotting constraints

3
 Plotting the objective function lines

4
 Optimal point