Linear Programming

Graphical method

Submitted by Priyanka shrivastava

ISBE -B

Agenda
Formulation Of LPP Graphical method1. Maximization case 2. Minimization case Feasible region.

LP Model Formulation
Decision variables

mathematical symbols representing levels of activity of an operation

Objective function

a linear relationship reflecting the objective of an operation most frequent objective of business firms is to maximize profit most frequent objective of individual operational units (such as a production or packaging department) is to minimize cost

Constraint

a linear relationship representing a restriction on decision making

LP Model Formulation
Max/min subject to: a11x1 + a12x2 + ... + a1nxn (, =, ) b1 a21x1 + a22x2 + ... + a2nxn (, =, ) b2 : am1x1 + am2x2 + ... + amnxn (, =, ) bm xj = decision variables bi = constraint levels cj = objective function coefficients aij = constraint coefficients z = c1x1 + c2x2 + ... + cnxn

Graphical Method Steps 1. 2. 3. 4. Identify the problem The decision variables The objective function The constraints restrictions Draw a graph & Identify the feasible region. Obtain the point on the feasible region. Interpret the result.
4

LP Model: Example
RESOURCE REQUIREMENTS PRODUCT Bowl Mug Labor (hr/unit) 1 2 Clay (lb/unit) 4 3 Revenue ($/unit) 40 50

There are 40 hours of labor and 120 pounds of clay available each day Decision variables x1 = number of bowls to produce x2 = number of mugs to produce

LP Formulation: Example
Maximize Z = $40 x1 + 50 x2 Subject to x1 + 2x2 40 hr (labor constraint) 4x1 + 3x2 120 lb (clay constraint) x1 , x2 0

Solution is x1 = 24 bowls Revenue = $1,360

x2 = 8 mugs

Graphical Solution: Example

x2 50 40 30 20 10 0 | 10 | 20 | 30 | 40

4 x1 + 3 x2 120 lb

Area common to both constraints x1 + 2 x2 40 hr

| 50 | 60 x1

Computing Optimal Values

x2 40 30 20 10 8

4 x1 + 3 x2 120 lb

x1 + 2x2 = 40 4x1 + 3x2 = 120

4x1 + 8x2 = 160 -4x1 - 3x2 = -120

5x2 = x2 = x1 + 2(8) = x1 = 40 8 40 24

x1 + 2 x2 40 hr
| x1 40

| 10

| 24 | 20 30

Z = $50(24) + $50(8) = $1,360

Extreme Corner Points

x2
40

x1 = 0 bowls x2 =20 mugs Z = $1,000

30
20 A 10 0 | 10 | 20

Optimal solutionx1 = 24 bowls x2 =8 mugs x1 = 30 bowls Z = $1,360 x2 =0 mugs Z = $1,200

B
| C| 30 40

x1

Minimization Problem
CHEMICAL CONTRIBUTION Brand Gro-plus Crop-fast Nitrogen (lb/bag) 2 4 Phosphate (lb/bag) 4 3

Minimize Z = $6x1 + $3x2 subject to 2x1 + 4x2 16 lb of nitrogen 4x1 + 3x2 24 lb of phosphate x1 , x2 0

10

Graphical Solution
x2 14

x1 = 0 bags of Gro-plus 12 x = 8 bags of Crop-fast 2 Z = $24 10

8A 6 4 X1=1.8 bags X2=4.4 bags X1= 8 bags Z=31.8$ B | 2 | 4 | 6 | 8

Z = 6x1 + 3x2

2
0

| 10

| 12

| 14

X2=0 bags Z= 48$

x1

11

The Graphical Analysis of Linear Programming

The set of all points that satisfy all the constraints of the model is called

a
FEASIBLE REGION

12

The Linear Programming ModelExample

Max z= 8X1 + 5X2 subject to 2X1 + 1X2 1000 3X1 + 4X2 2400 X1 + X2 700 X1 - X2 350 Xj> = 0, j = 1,2 (Weekly profit) (Plastic) (Production Time) (Total production) (Mix) (Non negativity)
13

Graphical Analysis the Feasible Region

X2

The non-negativity constraints

X1

14

Graphical Analysis the Feasible Region

X2

1000

The Plastic constraint 2X1+X2 1000

Total production constraint: X1+X2 700 (redundant)

700 500

Infeasible
Production Time 3X1+4X2 2400

Feasible
500
700 X1

15

Graphical Analysis the Feasible Region

X2

1000

The Plastic constraint 2X1+X2 1000 Total production constraint: X1+X2 700 (redundant)

700 500

Infeasible
Feasible
500
700

Production Time 3X1+4X22400

Production mix constraint: X1-X2 350

X1

The search for an optimal solution

X2
1000

Start at some arbitrary profit, say profit = $2,000... Then increase the profit, if possible... ...and continue until it becomes infeasible

700 500

Profit =$4360

X1 500

17

Models Without Unique Optimal Solutions

Infeasibility: Occurs when a model has no feasible

point.
Unboundness: Occurs when the objective can become infinitely large (max), or infinitely small (min).
18

Infeasible Model
No point, simultaneously, lies both above line 1 and
2

below lines 2 and 3

19

Unbounded solution

20