To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-1 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J. 07458 Quantitative Analysis.

Slides:



Advertisements
Similar presentations
Assignment (6) Simplex Method for solving LP problems with two variables.
Advertisements

The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 9-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 9 Linear.
LINEAR PROGRAMMING SIMPLEX METHOD
Linear Programming: The Simplex Method
Linear Programming Models: Graphical Methods
LINEAR PROGRAMMING (LP)
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 8-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 8 LP.
Managerial Decision Modeling with Spreadsheets
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
The Simplex Method: Standard Maximization Problems
Linear Programming Models: Graphical and Computer Methods
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 7-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 7 Linear.
Prepared by Lee Revere and John Large
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 99 Chapter 4 The Simplex Method.
Linear Programming (LP)
5.6 Maximization and Minimization with Mixed Problem Constraints
Chapter 4 The Simplex Method
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Algorithms CISC 4080/CISC 5825 Linear Programming, Simplex Method and Duality Theory Dr Kamesam Graduate School Of Business Fordham University.
LINEAR PROGRAMMING SIMPLEX METHOD.
PowerPoint presentation to accompany Operations Management, 6E (Heizer & Render) © 2001 by Prentice Hall, Inc., Upper Saddle River, N.J B-1 Operations.
The Dual Problem: Minimization with problem constraints of the form ≥
Chapter 6 Linear Programming: The Simplex Method
Duality Theory LI Xiaolei.
Topic III The Simplex Method Setting up the Method Tabular Form Chapter(s): 4.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming: The Simplex Method Chapter 5.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Transparency Masters to accompany Heizer/Render – Principles of Operations Management, 5e, and Operations Management, 7e © 2004 by Prentice Hall, Inc.,
Duality Theory  Every LP problem (called the ‘Primal’) has associated with another problem called the ‘Dual’.  The ‘Dual’ problem is an LP defined directly.
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Linear Programming: The Simplex Method.
Business Mathematics MTH-367 Lecture 15. Chapter 11 The Simplex and Computer Solutions Methods continued.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 11-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 11.
Linear Programming Erasmus Mobility Program (24Apr2012) Pollack Mihály Engineering Faculty (PMMK) University of Pécs João Miranda
 Minimization Problem  First Approach  Introduce the basis variable  To solve minimization problem we simple reverse the rule that is we select the.
1 1 Slide © 2005 Thomson/South-Western Linear Programming: The Simplex Method n An Overview of the Simplex Method n Standard Form n Tableau Form n Setting.
Chapter 4 Linear Programming: The Simplex Method
Linear Programming Models: Graphical and Computer Methods
Simplex Method for solving LP problems with two variables.
An-Najah N. University Faculty of Engineering and Information Technology Department of Management Information systems Operations Research and Applications.
Simplex Method Simplex: a linear-programming algorithm that can solve problems having more than two decision variables. The simplex technique involves.
© 2008 Prentice-Hall, Inc. Linear Programming Models: Graphical and Computer Methods.
Business Mathematics MTH-367 Lecture 16. Chapter 11 The Simplex and Computer Solutions Methods continued.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Linear Programming: An Algebraic Approach 4 The Simplex Method with Standard Maximization.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 7-1 1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 7 Linear.
1 Simplex algorithm. 2 The Aim of Linear Programming A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear.
Decision Support Systems INF421 & IS Simplex: a linear-programming algorithm that can solve problems having more than two decision variables.
Linear Programming Models: Graphical and Computer Methods 7 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna.
GOOD MORNING CLASS! In Operation Research Class, WE MEET AGAIN WITH A TOPIC OF :
Chapter 4 The Simplex Algorithm and Goal Programming
The Simplex Method. and Maximize Subject to From a geometric viewpoint : CPF solutions (Corner-Point Feasible) : Corner-point infeasible solutions 0.
PowerPoint presentation to accompany Operations Management, 6E (Heizer & Render) © 2001 by Prentice Hall, Inc., Upper Saddle River, N.J B-1 PENYELESAIAN.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Linear Programming Models: Graphical and Computer Methods
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
MBA 651 Quantitative Methods for Decision Making
Chapter 4 Linear Programming: The Simplex Method
The Simplex Method: Standard Minimization Problems
ISS500E-Quantitiative Decision Tehniques
Linear Programming SIMPLEX METHOD.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Lecture 4 Part I Mohamed A. M. A..
Chapter 5. The Duality Theorem
Chapter 4 The Simplex Algorithm
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Presentation transcript:

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-1 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Quantitative Analysis for Management Linear Programming Models:

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-2 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Linear Programming Problem  1. Tujuan adalah maximize or minimize variabel dependen dari beberapa kuantitas variabel independen (fungsi tujuan).  2. Batasan-batasan yang diperlukan guna mencapai tujuan.  Tujuan dan Batasan dinyatakan dalam persamaan linear.

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-3 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Basic Assumptions of Linear Programming  Certainty  Proportionality  Additivity  Divisibility  Nonnegativity

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-4 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Flair Furniture Company Data - Table 7.1 Hours Required to Produce One Unit Department X 1 Tables X 2 Chairs Available Hours This Week Carpentry Painting/Varnishing Profit/unit$7$5

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-5 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Flair Furniture Company Data - Table 7.1 Constraints: Maximize: Objective: )varnishing & (painting    XX   XX  )(carpentry    XX STEP 1: STEP 2:

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-6 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Flair Furniture Company Feasible Region Number of Chairs Number of Tables Painting/Varnishing Carpentry Feasible Region STEP 3: Plot Constraints

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-7 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Flair Furniture Company Isoprofit Lines Number of Chairs Number of Tables Painting/Varnishing Carpentry 7X 1 + 5X 2 = 210 7X 1 + 5X 2 = 420 STEP 4: Plot Objective Function

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-8 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Flair Furniture Company Optimal Solution Number of Chairs Number of Tables Painting/Varnishing Carpentry Solution (X 1 = 30, X 2 = 40) Corner Points

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-9 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Test Corner Point Solutions Point 1) (0,0) => 7(0) + 5(0) = $0 Point 2) (0,100) => 7(0) + 5(80) = $400 Point 3) (30,40) => 7(30) + 5(40) = $410 Point 4) (50,0) => 7(50) + 5(0) = $350

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-10 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Solve Equations Simultaneously 4X1 + 3X2 <= 240 2X1 + 1X2 <= 100 X1 = /4 X2 X1 = /2 X /4 X2 = /2 X = 3/4 X2 - 1/2 X2 10 = 1/4 X2 40 = X2; so, 4X1 + 3(40) = 240 4X1 = X1 = 30 To get X1 & X2 values for Point 3:

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-11 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Special Cases in LP  Infeasibility  Unbounded Solutions  Redundancy  Degeneracy  More Than One Optimal Solution

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-12 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J A Problem with No Feasible Solution X2X2 X1X Region Satisfying 3rd Constraint Region Satisfying First 2 Constraints

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-13 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J A Solution Region That is Unbounded to the Right X2X2 X1X Feasible Region X 1 > 5 X 2 < 10 X 1 + 2X 2 > 10

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-14 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J A Problem with a Redundant Constraint X2X2 X1X Feasible Region 2X 1 + X 2 < 30 X 1 < 25 X 1 + X 2 < 20 Redundant Constraint

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 7-15 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J An Example of Alternate Optimal Solutions Optimal Solution Consists of All Combinations of X 1 and X 2 Along the AB Segment Isoprofit Line for $12 Overlays Line Segment Isoprofit Line for $8 A B AB

To accompany Quantitative Analysis for Management, 7e by Render/Stair 8-16 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Marketing Applications Media Selection - Win Big Gambling Club

To accompany Quantitative Analysis for Management, 7e by Render/Stair 8-17 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Win Big Gambling Club :toSubject )spots/weekTV(max 12X 1  expense) radio(max X290X 43  )spots/week radio (min   XX budget)ad weekly   (XXX X )spots/week radio min.-1(max   X )spots/week radio sec.-30max   (X ads/week) newspapermax   (X :Maximize   XXXX

To accompany Quantitative Analysis for Management, 7e by Render/Stair 8-18 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Manufacturing Applications Production Mix - Fifth Avenue

To accompany Quantitative Analysis for Management, 7e by Render/Stair 8-19 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Fifth Avenue 4.00X3.56X3.07X4.08X :Maximize 4321  1) blend max, (contract X 3  2) blend max,(contract    X 2) blend min, (contract    X 1) blend min, (contract    X polyester) all max, (contract    X polyester) all min, (contract    X silk) max, (contract    Xsilk) min, (contract    X :toSubject cotton) (yards    X.X. polyester) (yards    X.X.X. silk) of (yards    X.

To accompany Quantitative Analysis for Management, 7e by Render/Stair 8-20 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Manufacturing Applications Truck Loading - Goodman Shipping ItemValue ($)Weight (lbs) 122,5007, ,0007,500 38,0003,000 49,5003, ,5004,000 69,7503,500

To accompany Quantitative Analysis for Management, 7e by Render/Stair 8-21 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Goodman Shipping                               X X X X X X X XXXXX XX XXXX (Capacity) :toSubject :value load Maximize

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-22 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Flair Furniture Company Hours Required to Produce One Unit Department X 1 Tables X 2 Chairs Available Hours This Week Carpentry Painting/Varnishing Profit/unit Constraints: $7$5 Maximize: Objective: )varnishing & (painting    XX   XX  )(carpentry    XX

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-23 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Flair Furniture Company's Feasible Region & Corner Points Number of Chairs X X2X2 Number of Tables B = (0,80) C = (30,40) D = (50,0) Feasible Region    XX    XX

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-24 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Flair Furniture - Adding Slack Variables )varnishing & (painting    XX )(carpentry    XXConstraints: Constraints with Slack Variables )varnishing& (painting )(carpentry       S XX SXX   XX  Objective Function Objective Function with Slack Variables   SSXX 

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-25 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Flair Furniture’s Initial Simplex Tableau Profit per Unit Column Production Mix Column Real Variables Columns Slack Variables Columns Constant Column CjCj Solution Mix X1X1 X2X2 S1S1 S2S2 Quantity $7$5$0 Profit per unit row $0 $7$5$0 S1S1 S2S2 ZjZj C j - Z j $0 Constraint equation rows Gross profit row Net profit row

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-26 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Pivot Row, Pivot Number Identified in the Initial Simplex Tableau CjCj Solution Mix X1X1 X2X2 S1S1 S2S2 Quantity $7$5$ $7$5$0 S1S1 S2S2 ZjZj C j - Z j $0 Pivot row Pivot number Pivot column

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-27 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Completed Second Simplex Tableau for Flair Furniture CjCj Solution Mix X1X1 X2X2 S1S1 S2S2 Quantity $7$5$0 11/ $7$7/2 $0 $3/2-$7/2$0 $7 $0 X1X1 S2S2 ZjZj C j - Z j $350

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-28 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Pivot Row, Column, and Number Identified in Second Simplex Tableau CjCj Solution Mix X1X1 X2X2 S1S1 S2S2 Quantity $7$5$0 11/ $7$7/2 $0 $3/2-$7/2$0 $7 $0 X1X1 S2S2 ZjZj C j - Z j $350 (Total Profit) Pivot row Pivot number Pivot column

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-29 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Calculating the New X 1 Row for Flair’s Third Tableau ( Number in new X 1 row ) Number in old X 1 row ( ) Number above pivot number ( ) Corresponding number in new X 2 row ( ) = - x =-x 1 0 3/2 -1/ / (1/2)(1/2) (0) (1) (-2) (1) (40) =-x =-x =-x =-x

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-30 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Final Simplex Tableau for the Flair Furniture Problem CjCj Solution Mix X1X1 X2X2 S1S1 S2S2 Quantity $7$5$0 103/2-1/ $75$1/2$3/2 $0 -$1/2-$3/2 $7 $5 X1X1 X2X2 ZjZj C j - Z j $410

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-31 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Simplex Steps for Maximization 1. Choose the variable with the greatest positive C j - Z j to enter the solution. 2. Determine the row to be replaced by selecting that one with the smallest (non-negative) quantity-to- pivot-column ratio. 3. Calculate the new values for the pivot row. 4. Calculate the new values for the other row(s). 5. Calculate the C j and C j - Z j values for this tableau. If there are any C j - Z j values greater than zero, return to Step 1.

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-32 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Surplus & Artificial Variables Constraints       XX XXX       AXX ASXXX Constraints-Surplus & Artificial Variables Objective Function   XXX  :Min   MA SXXX  :Min Objective Function-Surplus & Artificial Variables

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-33 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Simplex Steps for Minimization 1. Choose the variable with the greatest negative C j - Z j to enter the solution. 2. Determine the row to be replaced by selecting that one with the smallest (non-negative) quantity-to- pivot-column ratio. 3. Calculate the new values for the pivot row. 4. Calculate the new values for the other row(s). 5. Calculate the C j and C j - Z j values for this tableau. If there are any C j - Z j values less than zero, return to Step 1.

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-34 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Special Cases Infeasibility

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-35 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Special Cases Unboundedness Pivot Column

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-36 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Special Cases Degeneracy Pivot Column

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-37 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Special Cases Multiple Optima

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-38 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Sensitivity Analysis High Note Sound Company          XX XX X X :toSubject :Max

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-39 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Sensitivity Analysis High Note Sound Company

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-40 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Simplex Solution High Note Sound Company

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-41 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Simplex Solution High Note Sound Company

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-42 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Nonbasic Objective Function Coefficients

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-43 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Basic Objective Function Coefficients

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-44 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Simplex Solution High Note Sound Company Objective increases by 30 if 1 additional hour of electricians time is available.

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-45 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Steps to Form the Dual To form the Dual:  If the primal is max., the dual is min., and vice versa.  The right-hand-side values of the primal constraints become the objective coefficients of the dual.  The primal objective function coefficients become the right-hand-side of the dual constraints.  The transpose of the primal constraint coefficients become the dual constraint coefficients.  Constraint inequality signs are reversed.

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-46 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Primal & Dual          XX XX XX :toSubject :Max Primal:Dual          UU UU UU :toSubject :Min

To accompany Quantitative Analysis for Management, 7e by Render/ Stair 9-47 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Comparison of the Primal and Dual Optimal Tableaus Dual’s Optimal Solution