Lecture 3 The Graphical Method

Our Very First Example

The Opti Mize Company manufactures two products that compete for the same (limited) resources. Relevant information is:
Product Labor-hrs/unit Machine hrs/unit Cost/unit Profit/unit A 1 2 $6 $5 B 2 2 $20 $15 Available resources 20 hrs/day 30 hrs/day $180/day

Let X = number of units of product A to manufacture Y = number of units of product B to manufacture Max Profit = z = 5 X + 15 Y subject to: X + 2 Y <= 20 (labor-hours) 2 X + 2 Y <= 30 (machine hours) 6 X + 20Y <= 180 ($ - budget) X >= 0, Y >= 0

Graphical Analysis the Feasible Region

X2

The non-negativity constraints

X1

The Graphical Solution

Y
20 2X + 2Y = 30 15

X = number of units of product A to manufacture Y = number of units of product B to manufacture Max Profit z = 5 X + 15 Y subject to: X + 2Y <= 20 (labor-hours) 2X + 2Y <= 30 (machine hours) 6X + 2Y <= 180 ($ - budget) X >= 0, Y >= 0

The feasible region

10 9 5

6X + 2Y = 180

X + 2 Y = 20

10

15

20

25

30

The Graphical Solution Alternate Approach

Y
20 15

Z = 5X + 15Y

(x = 5, y = 7.5; z = 137.5)

10 9 5

(x = 10, y = 5; z = 125) (x = 0, y = 0; z = 0)

5 (x = 0, y = 9; z = 135)

10

15

20 25 (x = 15, y = 0; z = 75)

30

X
5

Y
20

The Graphical Solution (continued)

Z = 5 (5) + 15 (7.5) = 137.5

15

(5, 7.5)

Z = 5X + 15Y = 60
10 9 4 2 5 6 10 12 15 20 25 30

Z = 5X + 15Y = 30

X
6

The Graphical Analysis of Linear Programming

The set of all points that satisfy all the constraints of the model is called a FEASIBLE REGION
Using a graphical presentation we can represent all the constraints, the objective function, and the three types of feasible points.
7

This is powerful stuff! Can we see another example followed by a description of the general model?

Sure can ..
8

The Galaxy Industries Production Problem

Galaxy manufactures two toy doll models: Space Ray. Zapper. Resources are limited to 1000 pounds of special plastic. 40 hours of production time per week. Marketing requirements Total production cannot exceed 700 dozens. Number of dozens of Space Rays cannot exceed number of dozens of Zappers by more than 350

The Galaxy Industries Production Problem

Technological input Space Rays requires 2 pounds of plastic and 3 minutes of labor per dozen. Zappers requires 1 pound of plastic and 4 minutes of labor per dozen. The current production plan calls for: Producing as much as possible of the more profitable product, Space Ray ($8 profit per dozen). Use resources left over to produce Zappers ($5 profit per dozen), while remaining within the marketing guidelines. Management is seeking a production schedule that will increase the companys profit.

10

The Galaxy LP Model

Decisions variables: X1 = Weekly production level of Space Rays (in dozens) X2 = Weekly production level of Zappers (in dozens) Objective Function: Weekly profit, to be maximized Max 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) (Nonnegativity)

11

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

12

X2 1000

Graphical Analysis the Feasible Region

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

700 500

Infeasible Feasible
500 700

Production Time 3X1+4X2 2400

Production mix constraint: X1-X2 350

X1

Interior points. Boundary points. Extreme points.

There are three types of feasible points

13

Solving Graphically for an Optimal Solution

14

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

15

Summary of the optimal solution

Space Rays = 320 dozen Zappers = 360 dozen Profit = $4360 This solution utilizes all the plastic and all the production hours. Total production is only 680 (not 700). Space Rays production exceeds Zappers production by only 40 dozens.
16

Extreme points and optimal solutions

If a linear programming problem has an optimal solution, an extreme point is optimal.

17

Other Post - Optimality Changes

Addition of a constraint. Deletion of a constraint. Addition of a variable. Deletion of a variable. Changes in the left - hand side coefficients.
18

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). Multiple solutions: Occurs when more than one point optimizes the objective function
19

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

below lines 2 and 3 .

20

Unbounded solution

the

Th eF ef un cti ea on reg sib ion le

Ob jec

Ma

tiv

xim

ize

21

Multiple optimal solutions

For multiple optimal solutions to exist, the objective function must be parallel to one of the constraints Any weighted average of optimal solutions is also an optimal solution.

22

Lets Go to The Next Topic !!

23

Exercise 1
Suppose a company produces two types of widgets, manual and electric. Each requires in its manufacture the use of three machines; A, B, and C. A manual widget requires the use of the machine A for 2 hours, machine B for 1 hour, and machine C for 1 hour. An electric widget requires 1 hour on A, 2 hours on B, and 1 hour on C. Furthermore, suppose the maximum numbers of hours available per month for the use of machines A, B, and C are 180, 160, and 100, respectively. The profit on a manual widget is $4 and on electric widget it is $6. See the table below for a summary of data. If the company can sell all the widgets it can produce, how many of each type should it make in order to maximize the monthly profit?
Manual Electric A B C profit 2 1 1 $4 1 2 1 $6 Hours available 180 160 100

24

Exercise 1 continued
Step I Identify decision variables:
x = number of manual widgets y = number of electric widgets

Step II

Identify constraints:
2x + y x + 2y x+ y x y 180 160 100 0 0

25

Exercise 1 continued
Step III Define objective function: max P = 4x + 6y
Solving P for y gives y = -2/3 + P/3. This defines a so-called family of parallel lines, isoprofit lines. Each line gives all possible combinations of x and y that yield the same profit.
26

Exercise 1 continued

27

Exercise 1 continued

28

Exercise 2
The Classical Diet Problem
Mr. U. R. Fatte has been placed on a diet by his Doctor (Dr. Ima Quack) consisting of two foods: beer and ice cream. The doctor warned him to insure proper consumption of nutrients to sustain life. Relevant information is: Nutrients I II cost/oz Beer 2 mg/oz 6 mg/oz 10 cents Ice cream 3 mg/oz 2 mg/oz 4.5 cents
29

Weekly Requirement 3500 mg 7000 mg

Exercise 2 continued The Mathematical Model

Let X = ounces of beer consumed per week Y = ounces of ice cream consumed per week Min cost = z = 10 X + 4.5 Y subject to: 2X + 3Y >= 3500 6X + 2Y >= 7000 X, Y >= 0
30

Exercise 2 continued
Graphical Solution to the Diet Problem
Y
4000 6x + 2y = 7000

3000 Z = 10x + 4.5y = 18000 cents 2000 (x = 1000, y = 500; z = 122.50) 1000 2x + 3y = 3500 1000 2000 3000

X
31