+ All Categories
Home > Documents > 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming:...

3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming:...

Date post: 13-Dec-2015
Category:
Upload: gabriella-heath
View: 215 times
Download: 2 times
Share this document with a friend
Popular Tags:
42
3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3
Transcript
Page 1: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-1Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Linear Programming:

Computer Solution and Sensitivity

AnalysisChapter 3

Page 2: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-2

Chapter Topics

Computer Solution

Sensitivity Analysis

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 3: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-3

Early linear programming used lengthy manual mathematical solution procedure called the Simplex Method (See CD-ROM Module A).

Steps of the Simplex Method have been programmed in software packages designed for linear programming problems.

Many such packages available currently. Used extensively in business and

government. Text focuses on Excel Spreadsheets and QM

for Windows.

Computer Solution

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 4: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-4

Beaver Creek Pottery ExampleExcel Spreadsheet – Data Screen (1 of 6)

Exhibit 3.1

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 5: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-5

Beaver Creek Pottery Example“Solver” Parameter Screen (2 of 6)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Exhibit 3.2

Page 6: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-6

Exhibit 3.3

Beaver Creek Pottery ExampleAdding Model Constraints (3 of 6)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 7: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-7

Beaver Creek Pottery Example“Solver” Settings (4 of 6)

Exhibit 3.4Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 8: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-8Exhibit 3.5

Beaver Creek Pottery ExampleSolution Screen (5 of 6)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 9: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-9

Beaver Creek Pottery ExampleAnswer Report (6 of 6)

Exhibit 3.6

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 10: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-10

Linear Programming Problem: Standard Form

Standard form requires all variables in the constraint equations to appear on the left of the inequality (or equality) and all numeric values to be on the right-hand side.

Examples:

x3 x1 + x2 must be converted to x3 - x1 - x2 0

x1/(x2 + x3) 2 becomes x1 2 (x2 + x3)

and then x1 - 2x2 - 2x3 0

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 11: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-11

Beaver Creek Pottery ExampleQM for Windows (1 of 5)

Exhibit 3.7Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 12: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-12

Beaver Creek Pottery ExampleQM for Windows – Data Set Creation (2 of 5)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Exhibit 3.8

Page 13: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-13

Beaver Creek Pottery ExampleQM for Windows: Data Table (3 of 5)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Exhibit 3.9

Page 14: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-14

Beaver Creek Pottery ExampleQM for Windows: Model Solution (4 of 5)

Exhibit 3.10Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 15: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-15

Beaver Creek Pottery ExampleQM for Windows: Graphical Display (5 of 5)

Exhibit 3.11

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 16: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-16

Sensitivity analysis determines the effect on the optimal solution of changes in parameter values of the objective function and constraint equations.

Changes may be reactions to anticipated uncertainties in the parameters or to new or changed information concerning the model.

Beaver Creek Pottery ExampleSensitivity Analysis (1 of 4)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 17: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-17

Maximize Z = $40x1 + $50x2

subject to: x1 + 2x2 40 4x1 + 3x2 120

x1, x2 0

Figure 3.1Optimal Solution

Point

Beaver Creek Pottery ExampleSensitivity Analysis (2 of 4)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 18: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-18

Maximize Z = $100x1 + $50x2

subject to: x1 + 2x2 40 4x1 + 3x2 120

x1, x2 0

Figure 3.2 Changing the x1 Objective Function Coefficient

Beaver Creek Pottery ExampleChange x1 Objective Function Coefficient (3 of 4)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 19: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-19

Maximize Z = $40x1 + $100x2

subject to: x1 + 2x2 40 4x1 + 3x2 120

x1, x2 0

Figure 3.3 Changing the x2 Objective Function Coefficient

Beaver Creek Pottery ExampleChange x2 Objective Function Coefficient (4 of 4)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 20: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-20

The sensitivity range for an objective function coefficient is the range of values over which the current optimal solution point will remain optimal.

The sensitivity range for the xi coefficient is designated as ci.

Objective Function CoefficientSensitivity Range (1 of 3)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 21: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-21

objective function Z = $40x1 + $50x2 sensitivity range for:

x1: 25 c1 66.67 x2: 30 c2 80

Figure 3.4 Determining the Sensitivity Range for c1

Objective Function CoefficientSensitivity Range for c1 and c2 (2 of 3)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 22: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-22

Minimize Z = $6x1 + $3x2

subject to: 2x1 + 4x2 164x1 + 3x2 24

x1, x2 0

sensitivity ranges:

4 c1 0 c2 4.5

Objective Function CoefficientFertilizer Cost Minimization Example (3 of 3)

Figure 3.5 Fertilizer Cost Minimization Example

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 23: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-23

Exhibit 3.12

Objective Function Coefficient RangesExcel “Solver” Results Screen (1 of 3)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 24: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-24

Exhibit 3.13

Objective Function Coefficient RangesBeaver Creek Example Sensitivity Report (2 of 3)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 25: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-25

Exhibit 3.14

Objective Function Coefficient RangesQM for Windows Sensitivity Range Screen (3 of 3)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Sensitivity rangesfor objectivefunction coefficients

Page 26: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-26

Changes in Constraint Quantity ValuesSensitivity Range (1 of 4)

The sensitivity range for a right-hand-side value is the range of values over which the quantity’s value can change without changing the solution variable mix, including the slack variables.

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 27: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-27

Changes in Constraint Quantity ValuesIncreasing the Labor Constraint (2 of 4)

Maximize Z = $40x1 + $50x2

subject to: x1 + 2x2 + s1 = 40 4x1 + 3x2 + s2 = 120

x1, x2 0

Figure 3.6 Increasing the Labor Constraint Quantity

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 28: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-28

Changes in Constraint Quantity ValuesSensitivity Range for Labor Constraint (3 of 4)

Figure 3.7 Determining the Sensitivity Range for Labor QuantityCopyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 29: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-29

Changes in Constraint Quantity ValuesSensitivity Range for Clay Constraint (4 of 4)

Figure 3.8 Determining the Sensitivity Range for Clay QuantityCopyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 30: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-30Exhibit 3.15

Constraint Quantity Value Ranges by ComputerExcel Sensitivity Range for Constraints (1 of 2)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 31: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-31

Exhibit 3.16

Constraint Quantity Value Ranges by ComputerQM for Windows Sensitivity Range (2 of 2)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 32: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-32

Changing individual constraint parameters

Adding new constraints

Adding new variables

Other Forms of Sensitivity AnalysisTopics (1 of 4)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 33: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-33

Other Forms of Sensitivity AnalysisChanging a Constraint Parameter (2 of 4)

Maximize Z = $40x1 + $50x2

subject to: x1 + 2x2 40 4x1 + 3x2 120

x1, x2 0

Figure 3.9 Changing the x1 Coefficient in the Labor Constraint

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 34: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-34

Adding a new constraint to Beaver Creek Model: 0.20x1+ 0.10x2 5 hours for packaging Original solution: 24 bowls, 8 mugs, $1,360 profit

Exhibit 3.17

Other Forms of Sensitivity AnalysisAdding a New Constraint (3 of 4)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 35: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-35

Adding a new variable to the Beaver Creek model, x3, for a third product, cups

Maximize Z = $40x1 + 50x2 + 30x3

subject to:

x1 + 2x2 + 1.2x3 40 hr of labor

4x1 + 3x2 + 2x3 120 lb of clay

x1, x2, x3 0

Solving model shows that change has no effect on the original solution (i.e., the model is not sensitive to this change).

Other Forms of Sensitivity AnalysisAdding a New Variable (4 of 4)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 36: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-36

Defined as the marginal value of one additional unit of resource.

The sensitivity range for a constraint quantity value is also the range over which the shadow price is valid.

Shadow Prices (Dual Variable Values)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 37: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-37

Maximize Z = $40x1 + $50x2 subject to:

x1 + 2x2 40 hr of labor4x1 + 3x2 120 lb of clay

x1, x2 0

Exhibit 3.18

Excel Sensitivity Report for Beaver Creek PotteryShadow Prices Example (1 of 2)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 38: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-38

Excel Sensitivity Report for Beaver Creek PotterySolution Screen (2 of 2)

Exhibit 3.19Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 39: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-39

Two airplane parts: no.1 and no. 2. Three manufacturing stages: stamping, drilling,

finishing. Decision variables: x1 (number of part no. 1 to

produce) x2 (number of part no. 2 to

produce)

Model: Maximize Z = $650x1 + 910x2

subject to: 4x1 + 7.5x2 105 (stamping,hr) 6.2x1 + 4.9x2 90 (drilling, hr) 9.1x1 + 4.1x2 110 (finishing, hr) x1, x2 0

Example ProblemProblem Statement (1 of 3)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 40: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-40

Maximize Z = $650x1 + $910x2

subject to: 4x1 + 7.5x2 105 6.2x1 + 4.9x2 90 9.1x1 + 4.1x2 110 x1, x2 0

s1 = 0, s2 = 0, s3 = 11.35 hr

485.33 c1 1,151.4389.10 q1 137.76

Example ProblemGraphical Solution (2 of 3)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 41: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-41

Example ProblemExcel Solution (3 of 3)

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall

Page 42: 3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.

3-42Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall


Recommended