Linear Programming: Computer Solution and Sensitivity Analysis

Similar documents
Linear Programming: Sensitivity Analysis

Ch.03 Solving LP Models. Management Science / Prof. Bonghyun Ahn

Multicriteria Decision Making

Linear Programming: Model Formulation and Graphical Solution

Chapter 2. Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall 2-1

Modern Logistics & Supply Chain Management

Linear programming Dr. Arturo S. Leon, BSU (Spring 2010)

Worked Examples for Chapter 5

Graphical and Computer Methods

(b) For the change in c 1, use the row corresponding to x 1. The new Row 0 is therefore: 5 + 6

Introduction to Management Science (8th Edition, Bernard W. Taylor III) Chapter 11 Nonlinear Programming. Chapter 11 - Nonlinear Programming 1

Graphical Solution of LP Models

Exam. Name. Use the indicated region of feasible solutions to find the maximum and minimum values of the given objective function.

Introduction to LP. Types of Linear Programming. There are five common types of decisions in which LP may play a role

1. Introduce slack variables for each inequaility to make them equations and rewrite the objective function in the form ax by cz... + P = 0.

Nonlinear Programming

Multicriteria Decision Making

Optimization Methods in Management Science

Chapter 4 Test Review. 1. Sketch the graph of the equation 3x + 5y = Sketch the graph of the equation 4x + 3y = 24.

The Simplex Method of Linear Programming

OPERATIONS RESEARCH. Michał Kulej. Business Information Systems

Brief summary of linear programming and duality: Consider the linear program in standard form. (P ) min z = cx. x 0. (D) max yb. z = c B x B + c N x N

END3033 Operations Research I Sensitivity Analysis & Duality. to accompany Operations Research: Applications and Algorithms Fatih Cavdur

Chapter 2 Introduction to Optimization & Linear Programming

LINEAR PROGRAMMING 2. In many business and policy making situations the following type of problem is encountered:

Math Models of OR: Sensitivity Analysis

Introduction. Very efficient solution procedure: simplex method.

MAT016: Optimization

An Introduction to Linear Programming

Solving an optimization problem of a profit calculation taking into account fixed costs in Excel

Linear Programming. H. R. Alvarez A., Ph. D. 1

Welcome to CPSC 4850/ OR Algorithms

Transportation, Transshipment, and Assignment Problems

In Chapters 3 and 4 we introduced linear programming

Slack Variable. Max Z= 3x 1 + 4x 2 + 5X 3. Subject to: X 1 + X 2 + X x 1 + 4x 2 + X X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0

SAMPLE QUESTIONS. b = (30, 20, 40, 10, 50) T, c = (650, 1000, 1350, 1600, 1900) T.

UNIT-4 Chapter6 Linear Programming

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

Chapter 4 The Simplex Algorithm Part I

Deterministic Operations Research, ME 366Q and ORI 391 Chapter 2: Homework #2 Solutions

Optimisation. 3/10/2010 Tibor Illés Optimisation

Chapter 4. Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall 4-1

Theoretical questions and problems to practice Advanced Mathematics and Statistics (MSc course)

MATH 210 EXAM 3 FORM A November 24, 2014

36106 Managerial Decision Modeling Linear Decision Models: Part II

56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker

Linear programming: algebra

...(iii), x 2 Example 7: Geetha Perfume Company produces both perfumes and body spray from two flower extracts F 1. The following data is provided:

Introduction to Operations Research Prof G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Graph the linear inequality. 1) x + 2y 6

ECE 307- Techniques for Engineering Decisions

c) Place the Coefficients from all Equations into a Simplex Tableau, labeled above with variables indicating their respective columns

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

SENSITIVITY ANALYSIS IN LINEAR PROGRAMING: SOME CASES AND LECTURE NOTES

Sensitivity Analysis and Duality

Review Questions, Final Exam

Sensitivity Analysis and Duality in LP

INTERNATIONAL UNIVERSITY OF JAPAN Public Management and Policy Analysis Program Graduate School of International Relations

Simplex Method. Dr. rer.pol. Sudaryanto

Linear Programming Test Review. Day 6

MATH 445/545 Test 1 Spring 2016

MVE165/MMG631 Linear and integer optimization with applications Lecture 5 Linear programming duality and sensitivity analysis

Transportation, Transshipment, and Assignment Problems

IEOR 4404 Homework #4 Intro OR: Deterministic Models February 28, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #4

The Graphical Method & Algebraic Technique for Solving LP s. Métodos Cuantitativos M. En C. Eduardo Bustos Farías 1

Introduction to Mathematical Programming IE406. Lecture 10. Dr. Ted Ralphs

Linear programming. Debrecen, 2015/16, 1st semester. University of Debrecen, Faculty of Business Administration 1 / 46

+ 5x 2. = x x. + x 2. Transform the original system into a system x 2 = x x 1. = x 1

Theory of constraints and linear programming: a reexamination

4.7 Sensitivity analysis in Linear Programming

Demo 1: Solving LP problem graphically and with Excel Solver

OPRE 6201 : 3. Special Cases

Linear Programming Test Review. Day 6

Agricultural Economics 622 Midterm Exam on LP Topic Feb, Table 1. Technical Data by Processing Type Hog Processing Type

Integer Programming. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall

Finite Math Section 4_1 Solutions and Hints

Introduction to linear programming using LEGO.

Linear Programming and Marginal Analysis

Finite Mathematics MAT 141: Chapter 4 Notes

Optimization Methods in Management Science

Section 4.1 Solving Systems of Linear Inequalities

Optimization Methods in Management Science

February 22, Introduction to the Simplex Algorithm

Introduction to Operations Research. Linear Programming

Problem #1. The following matrices are augmented matrices of linear systems. How many solutions has each system? Motivate your answer.

LINEAR PROGRAMMING. Introduction

Introduction to Operations Research

ENGI 5708 Design of Civil Engineering Systems

Linear Programming: The Simplex Method

The use of shadow price is an example of sensitivity analysis. Duality theory can be applied to do other kind of sensitivity analysis:

CSCI5654 (Linear Programming, Fall 2013) Lecture-8. Lecture 8 Slide# 1

Exam 2 Review Math1324. Solve the system of two equations in two variables. 1) 8x + 7y = 36 3x - 4y = -13 A) (1, 5) B) (0, 5) C) No solution D) (1, 4)

30E00300 Productivity and Efficiency Analysis Abolfazl Keshvari, Ph.D.

1 Review Session. 1.1 Lecture 2

MA 162: Finite Mathematics - Section 3.3/4.1

Mathematics (JAN12MD0201) General Certificate of Education Advanced Level Examination January Unit Decision TOTAL.

Introduction. Formulating LP Problems LEARNING OBJECTIVES. Requirements of a Linear Programming Problem. LP Properties and Assumptions

Lesson 20: Polygraph with a Twist - Inequalities

Part 1. The Review of Linear Programming

Overview of course. Introduction to Optimization, DIKU Monday 12 November David Pisinger

Transcription:

Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3 3-1

Chapter Topics Computer Solution Sensitivity Analysis 3-2

Computer Solution 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. 3-3

Beaver Creek Pottery Example Excel Spreadsheet Data Screen (1 of 6) Exhibit 3.1 3-4

Beaver Creek Pottery Example Solver Parameter Screen (2 of 6) Exhibit 3.2 3-5

Beaver Creek Pottery Example Adding Model Constraints (3 of 6) Exhibit 3.3 3-6

Beaver Creek Pottery Example Solver Settings (4 of 6) Exhibit 3.4 3-7

Beaver Creek Pottery Example Solution Screen (5 of 6) Exhibit 3.5 3-8

Beaver Creek Pottery Example Answer Report (6 of 6) Exhibit 3.6 3-9

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: x 3 x 1 + x 2 must be converted to x 3 - x 1 - x 2 0 x 1 /(x 2 + x 3 ) 2 becomes x 1 2 (x 2 + x 3 ) and then x 1-2x 2-2x 3 0 3-10

Beaver Creek Pottery Example QM for Windows (1 of 5) Exhibit 3.7 3-11

Beaver Creek Pottery Example QM for Windows Data Set Creation (2 of 5) Exhibit 3.8 3-12

Beaver Creek Pottery Example QM for Windows: Data Table (3 of 5) Exhibit 3.9 3-13

Beaver Creek Pottery Example QM for Windows: Model Solution (4 of 5) Exhibit 3.10 3-14

Beaver Creek Pottery Example QM for Windows: Graphical Display (5 of 5) Exhibit 3.11 3-15

Beaver Creek Pottery Example Sensitivity Analysis (1 of 4) 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. 3-16

Beaver Creek Pottery Example Sensitivity Analysis (2 of 4) Maximize Z = $40x 1 + $50x 2 subject to: x 1 + 2x 2 40 4x 1 + 3x 2 120 x 1, x 2 0 Figure 3.1 Optimal Solution Point 3-17

Beaver Creek Pottery Example Change x 1 Objective Function Coefficient (3 of 4) Maximize Z = $100x 1 + $50x 2 subject to: x 1 + 2x 2 40 4x 1 + 3x 2 120 x 1, x 2 0 Figure 3.2 Changing the x 1 Objective Function Coefficient 3-18

Beaver Creek Pottery Example Change x 2 Objective Function Coefficient (4 of 4) Maximize Z = $40x 1 + $100x 2 subject to: x 1 + 2x 2 40 4x 1 + 3x 2 120 x 1, x 2 0 Figure 3.3 Changing the x 2 Objective Function Coefficient 3-19

Objective Function Coefficient Sensitivity Range (1 of 3) 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 x i coefficient is designated as c i. 3-20

Objective Function Coefficient Sensitivity Range for c 1 and c 2 (2 of 3) objective function Z = $40x 1 + $50x 2 sensitivity range for: x 1 : 25 c 1 66.67 x 2 : 30 c 2 80 Figure 3.4 Determining the Sensitivity Range for c 1 3-21

Objective Function Coefficient Fertilizer Cost Minimization Example (3 of 3) Minimize Z = $6x 1 + $3x 2 subject to: 2x 1 + 4x 2 16 4x 1 + 3x 2 24 x 1, x 2 0 sensitivity ranges: 4 c 1 0 c 2 4.5 Figure 3.5 Fertilizer Cost Minimization Example 3-22

Objective Function Coefficient Ranges Excel Solver Results Screen (1 of 3) Exhibit 3.12 3-23

Objective Function Coefficient Ranges Beaver Creek Example Sensitivity Report (2 of 3) Exhibit 3.13 3-24

Objective Function Coefficient Ranges QM for Windows Sensitivity Range Screen (3 of 3) Sensitivity ranges for objective function coefficients Exhibit 3.14 3-25

Changes in Constraint Quantity Values Sensitivity 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. 3-26

Changes in Constraint Quantity Values Increasing the Labor Constraint (2 of 4) Maximize Z = $40x 1 + $50x 2 subject to: x 1 + 2x 2 + s 1 = 40 4x 1 + 3x 2 + s 2 = 120 x 1, x 2 0 Figure 3.6 Increasing the Labor Constraint Quantity 3-27

Changes in Constraint Quantity Values Sensitivity Range for Labor Constraint (3 of 4) Figure 3.7 Determining the Sensitivity Range for Labor Quantity 3-28

Changes in Constraint Quantity Values Sensitivity Range for Clay Constraint (4 of 4) Figure 3.8 Determining the Sensitivity Range for Clay Quantity 3-29

Constraint Quantity Value Ranges by Computer Excel Sensitivity Range for Constraints (1 of 2) Exhibit 3.15 3-30

Constraint Quantity Value Ranges by Computer QM for Windows Sensitivity Range (2 of 2) Exhibit 3.16 3-31

Other Forms of Sensitivity Analysis Topics (1 of 4) Changing individual constraint parameters Adding new constraints Adding new variables 3-32

Other Forms of Sensitivity Analysis Changing a Constraint Parameter (2 of 4) Maximize Z = $40x 1 + $50x 2 subject to: x 1 + 2x 2 40 4x 1 + 3x 2 120 x 1, x 2 0 Figure 3.9 Changing the x 1 Coefficient in the Labor Constraint 3-33

Other Forms of Sensitivity Analysis Adding a New Constraint (3 of 4) Adding a new constraint to Beaver Creek Model: 0.20x 1 + 0.10x 2 5 hours for packaging Original solution: 24 bowls, 8 mugs, $1,360 profit Exhibit 3.17 3-34

Other Forms of Sensitivity Analysis Adding a New Variable (4 of 4) Adding a new variable to the Beaver Creek model, x 3, for a third product, cups Maximize Z = $40x 1 + 50x 2 + 30x 3 subject to: x 1 + 2x 2 + 1.2x 3 40 hr of labor 4x 1 + 3x 2 + 2x 3 120 lb of clay x 1, x 2, x 3 0 Solving model shows that change has no effect on the original solution (i.e., the model is not sensitive to this change). 3-35

Shadow Prices (Dual Variable Values) 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. 3-36

Excel Sensitivity Report for Beaver Creek Pottery Shadow Prices Example (1 of 2) Maximize Z = $40x 1 + $50x 2 subject to: x 1 + 2x 2 40 hr of labor 4x 1 + 3x 2 120 lb of clay x 1, x 2 0 Exhibit 3.18 3-37

Excel Sensitivity Report for Beaver Creek Pottery Solution Screen (2 of 2) Exhibit 3.19 3-38

Example Problem Problem Statement (1 of 3) Two airplane parts: no.1 and no. 2. Three manufacturing stages: stamping, drilling, finishing. Decision variables: x 1 (number of part no. 1 to produce) x 2 (number of part no. 2 to produce) Model: Maximize Z = $650x 1 + 910x 2 subject to: 4x 1 + 7.5x 2 105 (stamping,hr) 6.2x 1 + 4.9x 2 90 (drilling, hr) 9.1x 1 + 4.1x 2 110 (finishing, hr) x 1, x 2 0 3-39

Example Problem Graphical Solution (2 of 3) Maximize Z = $650x 1 + $910x 2 subject to: 4x 1 + 7.5x 2 105 6.2x 1 + 4.9x 2 90 9.1x 1 + 4.1x 2 110 x 1, x 2 0 s1 = 0, s2 = 0, s3 = 11.35 hr 485.33 c 1 1,151.43 89.10 q 1 137.76 3-40

Example Problem Excel Solution (3 of 3) 3-41

3-42