MATH507

Optimization Techniques
 Graphical Method - LLP
• Owing to the importance of linear
programming models in various industries, many
types of algorithms have been developed over
the years to solve them.
• Some famous mentions include the Simplex
method, the Hungarian approach, and others.
• Here we are going to concentrate on one of the
most basic methods to handle a linear
programming problem i.e. the graphical method.
• Step 1: Formulate the LP (Linear programming) problem.
• Step 2: Construct a graph and plot the constraint lines.
• Step 3: Determine the valid side of each constraint line.
• Step 4: Identify the feasible solution region.
• Step 5: Find the optimum point.
• Step 6: Calculate the coordinates of the optimum points
• Step 6: Evaluate the objective function at optimum points
to get the required maximum/minimum value of the
objective function.
 Example 1
Solve 3x + 5y <= 15 graphically

• Write the given constraint in

the form of equation i.e. 3x +
5y = 15
• Put x=0
– 3 * 0 + 5y = 15
– So y=3 point 1 =(0,3)
• Put y=0
– 3x + 5 * 0 = 15
– So x=15/3 = 5 point 2 =(5,0)
• Therefore the coordinates • Put x=0, y=0 in the given
are (0, 3) and (5, 0). constraint then
• Thus these points are joined to • 0<=15, the condition is true. (0, 0)
form a straight line is solution nearer to origin. So
shade the region below the line,
which is the feasible region.
• Put x=0, y=0 in the given constraint
3x + 5y < = 15
0<=15
• 0<15, the condition is true. (0, 0) is solution
nearer to origin. So shade the region below
the line, which is the feasible region.
• Example 2
Solve 3x + 5y >=15
put x and y =0
0>=15
 Example 3 : Max Z = 80x1 + 55x2
Subject to
4x1+ 2x2 ≤ 40
2x1 + 4x2 ≤ 32
x1 ≥ 0 , x2 ≥ 0

• The first constraint • The second constraint 2x1 +

4x1+ 2 x2 ≤ 40, written 4x2 ≤ 32, written in a form of
in a form of equation
equation
4x1+ 2 x2 = 40
• Put x1 =0
2x1 + 4x2 =32
– 4 * 0 + 2 x2 = 40 , • Put x1 =0
then x2 = 20 – 2 * 0 + 4x2 = 32 then x2 = 8
• Put x2 =0 • Put x2 =0
– 4 x1 + 2 * 0 = 40 then
x1 = 10
– 2x1 + 4 * 0 = 32 then x1 =16
• The coordinates are • The coordinates are
(0, 20) and (10, 0) (0, 8) and (16, 0)
 Steps

• 4x1+ 2x2 = 40

• X1=0, 2x2 = 40 , x2=40/2=20

• x1,x2) = (0,20)

• X2=0, 4x1=40 x1=40/4=10

• (x1, x2) = (10,0)
 Steps - eq-2
• The second constraint 2x1 + 4x2 ≤ 32, written
in a form of equation
2x1 + 4x2 =32
• Put x1 =0
– 2 * 0 + 4x2 = 32 then 32/4 =8 , x2 = 8
• Put x2 =0
– 2x1 + 4 * 0 = 32 i.e 32/2=16 then x1 =16
• The coordinates are (0, 8) and (16, 0)
 Eq 2: 2x1 + 4x2 ≤ 32
The coordinates are (0, 8) and (16, 0)

eq 1: 4x1+ 2x2 ≤ 40 (0, 20) and (10, 0)

• The graphical representation • The corner points of
is feasible region are A, B
and C.
• So the coordinates for
the corner points are
• A (0, 8)
• B (8, 4) (Solve the two
equations 4x1+ 2 x2 =
40 and 2x1 + 4x2 =32 to
get the coordinates)
• C (10, 0)
• O(0,0) == 0
Elimination Method
4x1 + 2x2 = 40  (1)
(2x1 + 4x2 = 32) * 2 (2)
4x1 + 8x2 = 64 (3)
(1)– (3)
-6x2 = -24  x2 = 4
Substitute x2 = 4 in (1)
4x1 + 2 * 4 = 40  4x1=32
X1=32/4
x1 = 8
So B(8,4)
4x1 + 2x2 = 40  (eq.1)
2x1 + 4x2 = 32 (eq.2)
• We know that Max Z = 80x1 + 55x2

• At A (0, 8)
Z = 80(0) + 55(8) = 440

• At B (8, 4)
Z = 80(8) + 55(4) = 860

• At C (10, 0)
Z = 80(10) + 55(0) = 800

• The maximum value is obtained at the point B. Therefore

Max Z = 860 and x1 = 8, x2 = 4
• X+Y<=50
• 3X+Y<=90
Example 4
 Seat Work
• Minimize Z = 10x1 + 4x2
Subject to
3x1 + 2x2 ≥ 60
7x1 + 2x2 ≥ 84
3x1 +6x2 ≥ 72
x1 ≥ 0 , x2 ≥ 0
• A manufacturer of furniture makes two products – chairs and tables.
Processing of this product is done on two machines A and B. A chair
requires 2 hours on machine A and 6 hours on machine B. A table
requires 5 hours on machine A and no time on machine B. There are
16 hours of time per day available on machine A and 30 hours on
machine B. Profit gained by the manufacturer from a chair and a
table is Rs 2 and Rs 10 respectively. What should be the daily
production of each of two products?