77
Lesson 29 (Section 19.1) Linear Programming: The Corner Principle Math 20 November 30, 2007 Announcements I Problem Set 11 on the WS. Due December 5. I next OH: Monday 1–2 (SC 323) I next PS: Sunday 6–7 (SC B-10) I Midterm II review: Tuesday 12/4, 7:30-9:00pm in Hall E I Midterm II: Thursday, 12/6, 7-8:30pm in Hall A

Lesson 29: Linear Programming I

Embed Size (px)

DESCRIPTION

In a linear programming problem, a linear function is to be optimized subject to linear inequality constraints. The corner principle says to solve such a problem all we have to do is look at the corners of the feasibility set.

Citation preview

Page 1: Lesson 29: Linear Programming I

Lesson 29 (Section 19.1)Linear Programming: The Corner Principle

Math 20

November 30, 2007

Announcements

I Problem Set 11 on the WS. Due December 5.

I next OH: Monday 1–2 (SC 323)

I next PS: Sunday 6–7 (SC B-10)

I Midterm II review: Tuesday 12/4, 7:30-9:00pm in Hall E

I Midterm II: Thursday, 12/6, 7-8:30pm in Hall A

Page 2: Lesson 29: Linear Programming I

Outline

Motivation: LP Problems

The Corner Principle

Solving 2D or 3D LP Problems

More Rolls and Cookies

The Duality Theorem

Page 3: Lesson 29: Linear Programming I

Motivational Example

Suppose a baker makes rolls and cookies. Rolls contain two ouncesof flour and one ounce of sugar per each. Cookies contain twoounces of sugar and one ounce of flour per each. The profit oneach roll sold is 8 cents, while the profit on each cookie sold is 10cents. The baker has 50 ounces of flour and 70 ounces of sugar onhand. How much of each bakery product should he make that day?

This is an optimization problem with inequalities. We have tomaximize

f (x , y) = 8x + 10y

subject to the constraints

2x + y ≤ 50 x ≥ 0

x + 2y ≤ 70 y ≥ 0.

Page 4: Lesson 29: Linear Programming I

Motivational Example

Suppose a baker makes rolls and cookies. Rolls contain two ouncesof flour and one ounce of sugar per each. Cookies contain twoounces of sugar and one ounce of flour per each. The profit oneach roll sold is 8 cents, while the profit on each cookie sold is 10cents. The baker has 50 ounces of flour and 70 ounces of sugar onhand. How much of each bakery product should he make that day?This is an optimization problem with inequalities. We have tomaximize

f (x , y) = 8x + 10y

subject to the constraints

2x + y ≤ 50 x ≥ 0

x + 2y ≤ 70 y ≥ 0.

Page 5: Lesson 29: Linear Programming I

When the objective function and constraint functions are linear(possibly with constants), we say the optimization problem is alinear programming problem.

Page 6: Lesson 29: Linear Programming I

The feasibility set

These are the points representing combinations of rolls and cookiesthat can be produced.

x5 10 15 20 25

y

5

10

15

20

25

30

35

I x ≥ 0

I y ≥ 0

I 2x + y ≤ 50

I x + 2y ≤ 70

The completefeasiblity set

Page 7: Lesson 29: Linear Programming I

The feasibility set

These are the points representing combinations of rolls and cookiesthat can be produced.

x5 10 15 20 25

y

5

10

15

20

25

30

35

I x ≥ 0

I y ≥ 0

I 2x + y ≤ 50

I x + 2y ≤ 70

The completefeasiblity set

Page 8: Lesson 29: Linear Programming I

The feasibility set

These are the points representing combinations of rolls and cookiesthat can be produced.

x5 10 15 20 25

y

5

10

15

20

25

30

35

I x ≥ 0

I y ≥ 0

I 2x + y ≤ 50

I x + 2y ≤ 70

The completefeasiblity set

Page 9: Lesson 29: Linear Programming I

The feasibility set

These are the points representing combinations of rolls and cookiesthat can be produced.

x5 10 15 20 25

y

5

10

15

20

25

30

35

I x ≥ 0

I y ≥ 0

I 2x + y ≤ 50

I x + 2y ≤ 70

The completefeasiblity set

Page 10: Lesson 29: Linear Programming I

The feasibility set

These are the points representing combinations of rolls and cookiesthat can be produced.

x5 10 15 20 25

y

5

10

15

20

25

30

35

I x ≥ 0

I y ≥ 0

I 2x + y ≤ 50

I x + 2y ≤ 70

The completefeasiblity set

Page 11: Lesson 29: Linear Programming I

The feasibility set

These are the points representing combinations of rolls and cookiesthat can be produced.

x5 10 15 20 25

y

5

10

15

20

25

30

35

I x ≥ 0

I y ≥ 0

I 2x + y ≤ 50

I x + 2y ≤ 70

The completefeasiblity set

Page 12: Lesson 29: Linear Programming I

Outline

Motivation: LP Problems

The Corner Principle

Solving 2D or 3D LP Problems

More Rolls and Cookies

The Duality Theorem

Page 13: Lesson 29: Linear Programming I

The Corner Principle

x5 10 15 20 25

y

5

10

15

20

25

30

35

(0, 0) (25, 0)

(10, 30)

(0, 35)

Look at the feasibleset as a subset of acontour plot of theobjective functionf (x , y):

I isoquants arelines

I Where thecritical points?

Page 14: Lesson 29: Linear Programming I

The Corner Principle

x5 10 15 20 25

y

5

10

15

20

25

30

35

(0, 0) (25, 0)

(10, 30)

(0, 35)

Look at the feasibleset as a subset of acontour plot of theobjective functionf (x , y):

I isoquants arelines

I Where thecritical points?

Page 15: Lesson 29: Linear Programming I

The Corner Principle

x5 10 15 20 25

y

5

10

15

20

25

30

35

(0, 0) (25, 0)

(10, 30)

(0, 35)

Look at the feasibleset as a subset of acontour plot of theobjective functionf (x , y):

I isoquants arelines

I Where thecritical points?

Page 16: Lesson 29: Linear Programming I

The Corner Principle

x5 10 15 20 25

y

5

10

15

20

25

30

35

(0, 0) (25, 0)

(10, 30)

(0, 35)

Look at the feasibleset as a subset of acontour plot of theobjective functionf (x , y):

I isoquants arelines

I Where thecritical points?

Page 17: Lesson 29: Linear Programming I

The Corner Principle

x5 10 15 20 25

y

5

10

15

20

25

30

35

(0, 0) (25, 0)

(10, 30)

(0, 35)

Look at the feasibleset as a subset of acontour plot of theobjective functionf (x , y):

I isoquants arelines

I Where thecritical points?

Page 18: Lesson 29: Linear Programming I

The Corner Principle

x5 10 15 20 25

y

5

10

15

20

25

30

35

(0, 0) (25, 0)

(10, 30)

(0, 35)

Look at the feasibleset as a subset of acontour plot of theobjective functionf (x , y):

I isoquants arelines

I Where thecritical points?

Page 19: Lesson 29: Linear Programming I

The Corner Principle

x5 10 15 20 25

y

5

10

15

20

25

30

35

(0, 0) (25, 0)

(10, 30)

(0, 35)

Look at the feasibleset as a subset of acontour plot of theobjective functionf (x , y):

I isoquants arelines

I Where thecritical points?

Page 20: Lesson 29: Linear Programming I

The Corner Principle

x5 10 15 20 25

y

5

10

15

20

25

30

35

(0, 0) (25, 0)

(10, 30)

(0, 35)

Look at the feasibleset as a subset of acontour plot of theobjective functionf (x , y):

I isoquants arelines

I Where thecritical points?

Page 21: Lesson 29: Linear Programming I

The Corner Principle

x5 10 15 20 25

y

5

10

15

20

25

30

35

(0, 0) (25, 0)

(10, 30)

(0, 35)

Look at the feasibleset as a subset of acontour plot of theobjective functionf (x , y):

I isoquants arelines

I Where thecritical points?

Page 22: Lesson 29: Linear Programming I

The Corner Principle

x5 10 15 20 25

y

5

10

15

20

25

30

35

(0, 0) (25, 0)

(10, 30)

(0, 35)

Look at the feasibleset as a subset of acontour plot of theobjective functionf (x , y):

I isoquants arelines

I Where thecritical points?

Page 23: Lesson 29: Linear Programming I

The Corner Principle

x5 10 15 20 25

y

5

10

15

20

25

30

35

(0, 0) (25, 0)

(10, 30)

(0, 35)

Look at the feasibleset as a subset of acontour plot of theobjective functionf (x , y):

I isoquants arelines

I Where thecritical points?

Page 24: Lesson 29: Linear Programming I

The Corner Principle

x5 10 15 20 25

y

5

10

15

20

25

30

35

(0, 0) (25, 0)

(10, 30)

(0, 35)

Look at the feasibleset as a subset of acontour plot of theobjective functionf (x , y):

I isoquants arelines

I Where thecritical points?

Page 25: Lesson 29: Linear Programming I

Theorem of the Day

Theorem (The Corner Principle)

In any linear programming problem, the extreme values of theobjective function, if achieved, will be achieved on a corner of thefeasibility set.

Page 26: Lesson 29: Linear Programming I

A Diet Problem

Example

A nutritionist is planning a menu that includes foods A and B asits main staples. Suppose that each ounce of food A contains 2units of protein, 1 unit of iron, and 1 unit of thiamine; each ounceof food B contains 1 unit of protein, 1 unit of iron, and 3 units ofthiamine. Suppose that each ounce of A costs 30 cents, while eachounce of B costs 40 cents. The nutritionist wants the meal toprovide at least 12 units of protein, at least 9 units of iron, and atleast 15 units of thiamine. How many ounces of each of the foodsshould be used to minimize the cost of the meal?

We want to minimize the cost

c = 30x + 40y

subject to the constraints

2x + y ≥ 12 x + y ≥ 9 x + 3y ≥ 15 x ≥ 0 y ≥ 0

Page 27: Lesson 29: Linear Programming I

A Diet Problem

Example

A nutritionist is planning a menu that includes foods A and B asits main staples. Suppose that each ounce of food A contains 2units of protein, 1 unit of iron, and 1 unit of thiamine; each ounceof food B contains 1 unit of protein, 1 unit of iron, and 3 units ofthiamine. Suppose that each ounce of A costs 30 cents, while eachounce of B costs 40 cents. The nutritionist wants the meal toprovide at least 12 units of protein, at least 9 units of iron, and atleast 15 units of thiamine. How many ounces of each of the foodsshould be used to minimize the cost of the meal?

We want to minimize the cost

c = 30x + 40y

subject to the constraints

2x + y ≥ 12 x + y ≥ 9 x + 3y ≥ 15 x ≥ 0 y ≥ 0

Page 28: Lesson 29: Linear Programming I

Feasibility Set for the diet problem

x2 4 6 8 10 12 14

y

2

4

6

8

10

12

14

I x ≥ 0

I y ≥ 0

I 2x + y ≥ 12

I x + y ≥ 9

I x + 3y ≥ 15

The completefeasiblity set. Noticeit’s unbounded.

Page 29: Lesson 29: Linear Programming I

Feasibility Set for the diet problem

x2 4 6 8 10 12 14

y

2

4

6

8

10

12

14

I x ≥ 0

I y ≥ 0

I 2x + y ≥ 12

I x + y ≥ 9

I x + 3y ≥ 15

The completefeasiblity set. Noticeit’s unbounded.

Page 30: Lesson 29: Linear Programming I

Feasibility Set for the diet problem

x2 4 6 8 10 12 14

y

2

4

6

8

10

12

14

I x ≥ 0

I y ≥ 0

I 2x + y ≥ 12

I x + y ≥ 9

I x + 3y ≥ 15

The completefeasiblity set. Noticeit’s unbounded.

Page 31: Lesson 29: Linear Programming I

Feasibility Set for the diet problem

x2 4 6 8 10 12 14

y

2

4

6

8

10

12

14

I x ≥ 0

I y ≥ 0

I 2x + y ≥ 12

I x + y ≥ 9

I x + 3y ≥ 15

The completefeasiblity set. Noticeit’s unbounded.

Page 32: Lesson 29: Linear Programming I

Feasibility Set for the diet problem

x2 4 6 8 10 12 14

y

2

4

6

8

10

12

14

I x ≥ 0

I y ≥ 0

I 2x + y ≥ 12

I x + y ≥ 9

I x + 3y ≥ 15

The completefeasiblity set. Noticeit’s unbounded.

Page 33: Lesson 29: Linear Programming I

Feasibility Set for the diet problem

x2 4 6 8 10 12 14

y

2

4

6

8

10

12

14

I x ≥ 0

I y ≥ 0

I 2x + y ≥ 12

I x + y ≥ 9

I x + 3y ≥ 15

The completefeasiblity set. Noticeit’s unbounded.

Page 34: Lesson 29: Linear Programming I

Outline

Motivation: LP Problems

The Corner Principle

Solving 2D or 3D LP Problems

More Rolls and Cookies

The Duality Theorem

Page 35: Lesson 29: Linear Programming I

Go back to the baker.

f (x , y) = 8x + 10y

We need only check the corners:

I f (0, 0) = 0

I f (25, 0) = 200

I f (0, 35) = 350

I f (10, 30) = 380

So the baker should make 10 rolls and 30 cookies. Mmmm . . .cookies.

Page 36: Lesson 29: Linear Programming I

Go back to the baker.

f (x , y) = 8x + 10y

We need only check the corners:

I f (0, 0) =

0

I f (25, 0) = 200

I f (0, 35) = 350

I f (10, 30) = 380

So the baker should make 10 rolls and 30 cookies. Mmmm . . .cookies.

Page 37: Lesson 29: Linear Programming I

Go back to the baker.

f (x , y) = 8x + 10y

We need only check the corners:

I f (0, 0) = 0

I f (25, 0) = 200

I f (0, 35) = 350

I f (10, 30) = 380

So the baker should make 10 rolls and 30 cookies. Mmmm . . .cookies.

Page 38: Lesson 29: Linear Programming I

Go back to the baker.

f (x , y) = 8x + 10y

We need only check the corners:

I f (0, 0) = 0

I f (25, 0) =

200

I f (0, 35) = 350

I f (10, 30) = 380

So the baker should make 10 rolls and 30 cookies. Mmmm . . .cookies.

Page 39: Lesson 29: Linear Programming I

Go back to the baker.

f (x , y) = 8x + 10y

We need only check the corners:

I f (0, 0) = 0

I f (25, 0) = 200

I f (0, 35) = 350

I f (10, 30) = 380

So the baker should make 10 rolls and 30 cookies. Mmmm . . .cookies.

Page 40: Lesson 29: Linear Programming I

Go back to the baker.

f (x , y) = 8x + 10y

We need only check the corners:

I f (0, 0) = 0

I f (25, 0) = 200

I f (0, 35) =

350

I f (10, 30) = 380

So the baker should make 10 rolls and 30 cookies. Mmmm . . .cookies.

Page 41: Lesson 29: Linear Programming I

Go back to the baker.

f (x , y) = 8x + 10y

We need only check the corners:

I f (0, 0) = 0

I f (25, 0) = 200

I f (0, 35) = 350

I f (10, 30) = 380

So the baker should make 10 rolls and 30 cookies. Mmmm . . .cookies.

Page 42: Lesson 29: Linear Programming I

Go back to the baker.

f (x , y) = 8x + 10y

We need only check the corners:

I f (0, 0) = 0

I f (25, 0) = 200

I f (0, 35) = 350

I f (10, 30) =

380

So the baker should make 10 rolls and 30 cookies. Mmmm . . .cookies.

Page 43: Lesson 29: Linear Programming I

Go back to the baker.

f (x , y) = 8x + 10y

We need only check the corners:

I f (0, 0) = 0

I f (25, 0) = 200

I f (0, 35) = 350

I f (10, 30) = 380

So the baker should make 10 rolls and 30 cookies. Mmmm . . .cookies.

Page 44: Lesson 29: Linear Programming I

Go back to the baker.

f (x , y) = 8x + 10y

We need only check the corners:

I f (0, 0) = 0

I f (25, 0) = 200

I f (0, 35) = 350

I f (10, 30) = 380

So the baker should make 10 rolls and 30 cookies.

Mmmm . . .cookies.

Page 45: Lesson 29: Linear Programming I

Go back to the baker.

f (x , y) = 8x + 10y

We need only check the corners:

I f (0, 0) = 0

I f (25, 0) = 200

I f (0, 35) = 350

I f (10, 30) = 380

So the baker should make 10 rolls and 30 cookies. Mmmm . . .cookies.

Page 46: Lesson 29: Linear Programming I

For the diet problem, we have to evaluate the cost function at eachof the corner points.

c = 30x + 40y

I c(15, 0) = 450

I c(0, 12) = 480

I c(6, 3) = 300

I c(3, 6) = 330

So we should use 6 units of ingredient A and 3 units of ingredientB.

Page 47: Lesson 29: Linear Programming I

For the diet problem, we have to evaluate the cost function at eachof the corner points.

c = 30x + 40y

I c(15, 0) =

450

I c(0, 12) = 480

I c(6, 3) = 300

I c(3, 6) = 330

So we should use 6 units of ingredient A and 3 units of ingredientB.

Page 48: Lesson 29: Linear Programming I

For the diet problem, we have to evaluate the cost function at eachof the corner points.

c = 30x + 40y

I c(15, 0) = 450

I c(0, 12) = 480

I c(6, 3) = 300

I c(3, 6) = 330

So we should use 6 units of ingredient A and 3 units of ingredientB.

Page 49: Lesson 29: Linear Programming I

For the diet problem, we have to evaluate the cost function at eachof the corner points.

c = 30x + 40y

I c(15, 0) = 450

I c(0, 12) =

480

I c(6, 3) = 300

I c(3, 6) = 330

So we should use 6 units of ingredient A and 3 units of ingredientB.

Page 50: Lesson 29: Linear Programming I

For the diet problem, we have to evaluate the cost function at eachof the corner points.

c = 30x + 40y

I c(15, 0) = 450

I c(0, 12) = 480

I c(6, 3) = 300

I c(3, 6) = 330

So we should use 6 units of ingredient A and 3 units of ingredientB.

Page 51: Lesson 29: Linear Programming I

For the diet problem, we have to evaluate the cost function at eachof the corner points.

c = 30x + 40y

I c(15, 0) = 450

I c(0, 12) = 480

I c(6, 3) =

300

I c(3, 6) = 330

So we should use 6 units of ingredient A and 3 units of ingredientB.

Page 52: Lesson 29: Linear Programming I

For the diet problem, we have to evaluate the cost function at eachof the corner points.

c = 30x + 40y

I c(15, 0) = 450

I c(0, 12) = 480

I c(6, 3) = 300

I c(3, 6) = 330

So we should use 6 units of ingredient A and 3 units of ingredientB.

Page 53: Lesson 29: Linear Programming I

For the diet problem, we have to evaluate the cost function at eachof the corner points.

c = 30x + 40y

I c(15, 0) = 450

I c(0, 12) = 480

I c(6, 3) = 300

I c(3, 6) =

330

So we should use 6 units of ingredient A and 3 units of ingredientB.

Page 54: Lesson 29: Linear Programming I

For the diet problem, we have to evaluate the cost function at eachof the corner points.

c = 30x + 40y

I c(15, 0) = 450

I c(0, 12) = 480

I c(6, 3) = 300

I c(3, 6) = 330

So we should use 6 units of ingredient A and 3 units of ingredientB.

Page 55: Lesson 29: Linear Programming I

For the diet problem, we have to evaluate the cost function at eachof the corner points.

c = 30x + 40y

I c(15, 0) = 450

I c(0, 12) = 480

I c(6, 3) = 300

I c(3, 6) = 330

So we should use 6 units of ingredient A and 3 units of ingredientB.

Page 56: Lesson 29: Linear Programming I

Outline

Motivation: LP Problems

The Corner Principle

Solving 2D or 3D LP Problems

More Rolls and Cookies

The Duality Theorem

Page 57: Lesson 29: Linear Programming I

Let’s go back to the baker. Suppose a factory wants to buyingredients from the baker and use them to make their own bakedgoods. What prices should they quote to the baker?

If the baker bakes and sells x rolls and y cookies, he makes8x + 10y dollars. He used 2x + y ounces of flour and x + 2y ouncesof sugar to make these products. If instead the baker sold theseingredients at prices p for flour and q for sugar, he would make

p(2x + y) + q(x + 2y) = (2p + q)x + (p + 2q)y

dollars. In order to make the deal attractive to the baker, thefactory needs to insure

2p+ q ≥ 8

p+2q ≥10

while minimizing their total payout 50p + 70q.

Page 58: Lesson 29: Linear Programming I

Let’s go back to the baker. Suppose a factory wants to buyingredients from the baker and use them to make their own bakedgoods. What prices should they quote to the baker?If the baker bakes and sells x rolls and y cookies, he makes8x + 10y dollars. He used 2x + y ounces of flour and x + 2y ouncesof sugar to make these products.

If instead the baker sold theseingredients at prices p for flour and q for sugar, he would make

p(2x + y) + q(x + 2y) = (2p + q)x + (p + 2q)y

dollars. In order to make the deal attractive to the baker, thefactory needs to insure

2p+ q ≥ 8

p+2q ≥10

while minimizing their total payout 50p + 70q.

Page 59: Lesson 29: Linear Programming I

Let’s go back to the baker. Suppose a factory wants to buyingredients from the baker and use them to make their own bakedgoods. What prices should they quote to the baker?If the baker bakes and sells x rolls and y cookies, he makes8x + 10y dollars. He used 2x + y ounces of flour and x + 2y ouncesof sugar to make these products. If instead the baker sold theseingredients at prices p for flour and q for sugar, he would make

p(2x + y) + q(x + 2y) = (2p + q)x + (p + 2q)y

dollars.

In order to make the deal attractive to the baker, thefactory needs to insure

2p+ q ≥ 8

p+2q ≥10

while minimizing their total payout 50p + 70q.

Page 60: Lesson 29: Linear Programming I

Let’s go back to the baker. Suppose a factory wants to buyingredients from the baker and use them to make their own bakedgoods. What prices should they quote to the baker?If the baker bakes and sells x rolls and y cookies, he makes8x + 10y dollars. He used 2x + y ounces of flour and x + 2y ouncesof sugar to make these products. If instead the baker sold theseingredients at prices p for flour and q for sugar, he would make

p(2x + y) + q(x + 2y) = (2p + q)x + (p + 2q)y

dollars. In order to make the deal attractive to the baker, thefactory needs to insure

2p+ q ≥ 8

p+2q ≥10

while minimizing their total payout 50p + 70q.

Page 61: Lesson 29: Linear Programming I

The Dual Problem

This concept can be applied in general. A linear programmingproblem is in standard form if it seeks to maximize a functionf (x) = p′x subject to constraints Ax ≤ b (or b− Ax ≥ 0). It turnsout that each such problem has a dual problem: to minimizeg(x) = b′x subject to A′q ≥ p.

Page 62: Lesson 29: Linear Programming I

Solving the Dual Problem

p

q

2 4 6 8 10

2

4

6

8

Problem: Minimize 50p + 70qsubject to 2p + q ≥ 8,p + 2q ≥ 10

The feasibility set can bedrawn. The corner points arefound and tested. Thechoices are

I z(10, 0) = 500

I z(0, 8) = 560

I z(2, 4) = 380

The factory should quotep = 2 and q = 4 to the bakerand the baker would get 380for it. This is the sameamount of money as if he hadbaked the goods and soldthem!

Page 63: Lesson 29: Linear Programming I

Solving the Dual Problem

p

q

2 4 6 8 10

2

4

6

8

Problem: Minimize 50p + 70qsubject to 2p + q ≥ 8,p + 2q ≥ 10The feasibility set can bedrawn.

The corner points arefound and tested. Thechoices are

I z(10, 0) = 500

I z(0, 8) = 560

I z(2, 4) = 380

The factory should quotep = 2 and q = 4 to the bakerand the baker would get 380for it. This is the sameamount of money as if he hadbaked the goods and soldthem!

Page 64: Lesson 29: Linear Programming I

Solving the Dual Problem

p

q

2 4 6 8 10

2

4

6

8

Problem: Minimize 50p + 70qsubject to 2p + q ≥ 8,p + 2q ≥ 10The feasibility set can bedrawn. The corner points arefound and tested. Thechoices are

I z(10, 0) =

500

I z(0, 8) = 560

I z(2, 4) = 380

The factory should quotep = 2 and q = 4 to the bakerand the baker would get 380for it. This is the sameamount of money as if he hadbaked the goods and soldthem!

Page 65: Lesson 29: Linear Programming I

Solving the Dual Problem

p

q

2 4 6 8 10

2

4

6

8

Problem: Minimize 50p + 70qsubject to 2p + q ≥ 8,p + 2q ≥ 10The feasibility set can bedrawn. The corner points arefound and tested. Thechoices are

I z(10, 0) =

500

I z(0, 8) = 560

I z(2, 4) = 380

The factory should quotep = 2 and q = 4 to the bakerand the baker would get 380for it. This is the sameamount of money as if he hadbaked the goods and soldthem!

Page 66: Lesson 29: Linear Programming I

Solving the Dual Problem

p

q

2 4 6 8 10

2

4

6

8

Problem: Minimize 50p + 70qsubject to 2p + q ≥ 8,p + 2q ≥ 10The feasibility set can bedrawn. The corner points arefound and tested. Thechoices are

I z(10, 0) = 500

I z(0, 8) =

560

I z(2, 4) = 380

The factory should quotep = 2 and q = 4 to the bakerand the baker would get 380for it. This is the sameamount of money as if he hadbaked the goods and soldthem!

Page 67: Lesson 29: Linear Programming I

Solving the Dual Problem

p

q

2 4 6 8 10

2

4

6

8

Problem: Minimize 50p + 70qsubject to 2p + q ≥ 8,p + 2q ≥ 10The feasibility set can bedrawn. The corner points arefound and tested. Thechoices are

I z(10, 0) = 500

I z(0, 8) =

560

I z(2, 4) = 380

The factory should quotep = 2 and q = 4 to the bakerand the baker would get 380for it. This is the sameamount of money as if he hadbaked the goods and soldthem!

Page 68: Lesson 29: Linear Programming I

Solving the Dual Problem

p

q

2 4 6 8 10

2

4

6

8

Problem: Minimize 50p + 70qsubject to 2p + q ≥ 8,p + 2q ≥ 10The feasibility set can bedrawn. The corner points arefound and tested. Thechoices are

I z(10, 0) = 500

I z(0, 8) = 560

I z(2, 4) =

380

The factory should quotep = 2 and q = 4 to the bakerand the baker would get 380for it. This is the sameamount of money as if he hadbaked the goods and soldthem!

Page 69: Lesson 29: Linear Programming I

Solving the Dual Problem

p

q

2 4 6 8 10

2

4

6

8

Problem: Minimize 50p + 70qsubject to 2p + q ≥ 8,p + 2q ≥ 10The feasibility set can bedrawn. The corner points arefound and tested. Thechoices are

I z(10, 0) = 500

I z(0, 8) = 560

I z(2, 4) =

380

The factory should quotep = 2 and q = 4 to the bakerand the baker would get 380for it. This is the sameamount of money as if he hadbaked the goods and soldthem!

Page 70: Lesson 29: Linear Programming I

Solving the Dual Problem

p

q

2 4 6 8 10

2

4

6

8

Problem: Minimize 50p + 70qsubject to 2p + q ≥ 8,p + 2q ≥ 10The feasibility set can bedrawn. The corner points arefound and tested. Thechoices are

I z(10, 0) = 500

I z(0, 8) = 560

I z(2, 4) = 380

The factory should quotep = 2 and q = 4 to the bakerand the baker would get 380for it. This is the sameamount of money as if he hadbaked the goods and soldthem!

Page 71: Lesson 29: Linear Programming I

Solving the Dual Problem

p

q

2 4 6 8 10

2

4

6

8

Problem: Minimize 50p + 70qsubject to 2p + q ≥ 8,p + 2q ≥ 10The feasibility set can bedrawn. The corner points arefound and tested. Thechoices are

I z(10, 0) = 500

I z(0, 8) = 560

I z(2, 4) = 380

The factory should quotep = 2 and q = 4 to the bakerand the baker would get 380for it.

This is the sameamount of money as if he hadbaked the goods and soldthem!

Page 72: Lesson 29: Linear Programming I

Solving the Dual Problem

p

q

2 4 6 8 10

2

4

6

8

Problem: Minimize 50p + 70qsubject to 2p + q ≥ 8,p + 2q ≥ 10The feasibility set can bedrawn. The corner points arefound and tested. Thechoices are

I z(10, 0) = 500

I z(0, 8) = 560

I z(2, 4) = 380

The factory should quotep = 2 and q = 4 to the bakerand the baker would get 380for it. This is the sameamount of money as if he hadbaked the goods and soldthem!

Page 73: Lesson 29: Linear Programming I

The dual problem determines what are often called the shadowprices of the choice variables. They are somehow the value of thestock on hand.

Discuss: should the baker really be indifferentbetween selling his products or his ingredients? Besides thephysical ingredients, we haven’t counted the use of his labor andhis overhead. Or just his preference for staying as a baker.

Page 74: Lesson 29: Linear Programming I

The dual problem determines what are often called the shadowprices of the choice variables. They are somehow the value of thestock on hand. Discuss: should the baker really be indifferentbetween selling his products or his ingredients?

Besides thephysical ingredients, we haven’t counted the use of his labor andhis overhead. Or just his preference for staying as a baker.

Page 75: Lesson 29: Linear Programming I

The dual problem determines what are often called the shadowprices of the choice variables. They are somehow the value of thestock on hand. Discuss: should the baker really be indifferentbetween selling his products or his ingredients? Besides thephysical ingredients, we haven’t counted the use of his labor andhis overhead. Or just his preference for staying as a baker.

Page 76: Lesson 29: Linear Programming I

Outline

Motivation: LP Problems

The Corner Principle

Solving 2D or 3D LP Problems

More Rolls and Cookies

The Duality Theorem

Page 77: Lesson 29: Linear Programming I

The Duality Theorem

The equality of payoff in the primal and dual problem is not anaccident. It will always be the case! The shadow prices are verymuch related to Lagrange multipliers.