1-1 Introduction to Optimization and Linear Programming Chapter 1.

Slides:



Advertisements
Similar presentations
Lesson 08 Linear Programming
Advertisements

Linear Programming.
Chapter 2: Modeling with Linear Programming & sensitivity analysis
CCMIII U2D4 Warmup This graph of a linear programming model consists of polygon ABCD and its interior. Under these constraints, at which point does the.
19 Linear Programming CHAPTER
Quantitative Techniques for Decision Making M.P. Gupta & R.B. Khanna © Prentice Hall India LINEAR PROGRAMMING GRAPHIC METHOD 2 CHAPTER.
1 Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc. Chapter 3 Introduction to Linear Programming to accompany Introduction to Mathematical.
1 Spreadsheet Modeling & Decision Analysis: A Practical Introduction to Management Science 3d edition by Cliff Ragsdale.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 6 th edition Cliff T. Ragsdale © 2011 Cengage Learning. All Rights.
Operations Management
Introduction to Management Science
Linear and Integer Programming Models
6s-1Linear Programming CHAPTER 6s Linear Programming.
Introduction to Management Science
Linear Programming: Model Formulation and Graphical Solution
Spreadsheet Modeling & Decision Analysis:
Chapter 3 An Introduction to Linear Programming
FORMULATION AND GRAPHIC METHOD
Linear Programming.
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
Linear Programming Models: Graphical and Computer Methods
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Introduction to Mathematical Programming OR/MA 504 Chapter 3.
Linear Programming Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
ISE 195 Introduction to Industrial Engineering. Lecture 3 Mathematical Optimization (Topics in ISE 470 Deterministic Operations Research Models)
Special Conditions in LP Models (sambungan BAB 1)
Readings Readings Chapter 3
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.
Spreadsheet Modeling & Decision Analysis:
2-1 Linear Programming: Model Formulation and Graphical Solution Chapter 2 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
1 Linear Programming: Model Formulation and Graphical Solution.
Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 6-1 Integer Linear Programming Chapter 6.
BUSINESS MATHEMATICS & STATISTICS. LECTURE 45 Planning Production Levels: Linear Programming.
1 1 Slide © 2005 Thomson/South-Western Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization.
OPSM 301 Operations Management Class 10: Introduction to Linear Programming Koç University Zeynep Aksin
1 Max 8X 1 + 5X 2 (Weekly profit) subject to 2X 1 + 1X 2  1000 (Plastic) 3X 1 + 4X 2  2400 (Production Time) X 1 + X 2  700 (Total production) X 1.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 3 Basics of the Simplex Algorithm.
Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization Problem n Graphical Solution Procedure.
CDAE Class 13 Oct. 10 Last class: Result of Quiz 3 3. Linear programming and applications Class exercise 5 Today: 3. Linear programming and applications.
Linear Programming (LP) Problems MAX (or MIN): c 1 X 1 + c 2 X 2 + … + c n X n Subject to:a 11 X 1 + a 12 X 2 + … + a 1 n X n
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
Chapter 1 Introduction n Introduction: Problem Solving and Decision Making n Quantitative Analysis and Decision Making n Quantitative Analysis n Model.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
2-1 Modeling with Linear Programming Chapter Optimal Solution for New Objective Function Graphical Solution of Maximization Model (12 of 12) Maximize.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
Linear Programming Models: Graphical and Computer Methods 7 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna.
1 1 Slide Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Spreadsheet Modeling & Decision Analysis:
An Introduction to Linear Programming
Chapter 2 An Introduction to Linear Programming
Linear Programming Topics General optimization model
Linear Programming Topics General optimization model
Linear Programming Topics General optimization model
Linear Programming Topics General optimization model
The application of mathematics and the scientific
Introduction to Optimization and Linear Programming (LP)
Spreadsheet Modeling & Decision Analysis
Operations Research Models
Optimization Theory Linear Programming
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Spreadsheet Modeling & Decision Analysis:
Presentation transcript:

1-1 Introduction to Optimization and Linear Programming Chapter 1

1-2 Introduction We all face decision about how to use limited resources such as: –Oil in the earth –Land for waste dumps –Time –Money –Workers

1-3 Mathematical Programming... MP is a field of operations research that finds the optimal, or most efficient, way of using limited resources to achieve the objectives of an individual or a business. a.k.a. Optimization

1-4 Applications of Optimization Determining Product Mix Manufacturing Routing and Logistics Financial Planning

1-5 Characteristics of Optimization Problems Decisions Constraints Objectives

1-6 General Form of an Optimization Problem MAX (or MIN): f 0 (X 1, X 2, …, X n ) Subject to: f 1 (X 1, X 2, …, X n )<=b 1 : f k (X 1, X 2, …, X n )>=b k : f m (X 1, X 2, …, X n )=b m Note: If all the functions in an optimization are linear, the problem is a Linear Programming (LP) problem

1-7 Linear Programming (LP) Problems MAX (or MIN): c 1 X 1 + c 2 X 2 + … + c n X n Subject to:a 11 X 1 + a 12 X 2 + … + a 1 n X n <= b 1 : a k 1 X 1 + a k 2 X 2 + … + a kn X n >=b k : a m 1 X 1 + a m 2 X 2 + … + a mn X n = b m

1-8 An Example LP Problem Blue Ridge Hot Tubs produces two types of hot tubs: Aqua-Spas & Hydro-Luxes. There are 200 pumps, 1566 hours of labor, and 2880 feet of tubing available. Aqua-SpaHydro-Lux Pumps11 Labor 9 hours6 hours Tubing12 feet16 feet Unit Profit$350$300

1-9 5 Steps In Formulating LP Models: 1. Understand the problem. 2. Identify the decision variables. X 1 =number of Aqua-Spas to produce X 2 =number of Hydro-Luxes to produce 3.State the objective function as a linear combination of the decision variables. MAX: 350X X 2

Steps In Formulating LP Models (continued) 4. State the constraints as linear combinations of the decision variables. 1X 1 + 1X 2 <= 200} pumps 9X 1 + 6X 2 <= 1566} labor 12X X 2 <= 2880} tubing 5. Identify any upper or lower bounds on the decision variables. X 1 >= 0 X 2 >= 0

1-11 LP Model for Blue Ridge Hot Tubs MAX: 350X X 2 S.T.:1X 1 + 1X 2 <= 200 9X 1 + 6X 2 <= X X 2 <= 2880 X 1 >= 0 X 2 >= 0

1-12 Solving LP Problems: An Intuitive Approach Idea: Each Aqua-Spa (X 1 ) generates the highest unit profit ($350), so let’s make as many of them as possible! How many would that be? –Let X 2 = 0 1st constraint:1X 1 <= 200 2nd constraint:9X 1 <=1566 or X 1 <=174 3rd constraint:12X 1 <= 2880 or X 1 <= 240 If X 2 =0, the maximum value of X 1 is 174 and the total profit is $350*174 + $300*0 = $60,900 This solution is feasible, but is it optimal? No!

1-13 Solving LP Problems: A Graphical Approach The constraints of an LP problem define the feasible region. The best point in the feasible region is the optimal solution to the problem. For LP problems with 2 variables, it is easy to plot the feasible region and find the optimal solution.

1-14 X2X2 X1X (0, 200) (200, 0) boundary line of pump constraint X 1 + X 2 = 200 Plotting the First Constraint

1-15 X2X2 X1X (0, 261) (174, 0) boundary line of labor constraint 9X 1 + 6X 2 = 1566 Plotting the Second Constraint

1-16 X2X2 X1X (0, 180) (240, 0) boundary line of tubing constraint 12X X 2 = 2880 Feasible Region Plotting the Third Constraint

1-17 X2X2 Plotting A Level Curve of the Objective Function X1X (0, ) (100, 0) objective function 350X X 2 = 35000

1-18 A Second Level Curve of the Objective Function X2X2 X1X (0, 175) (150, 0) objective function 350X X 2 = objective function 350X X 2 = 52500

1-19 Using A Level Curve to Locate the Optimal Solution X2X2 X1X objective function 350X X 2 = objective function 350X X 2 = optimal solution

1-20 Calculating the Optimal Solution The optimal solution occurs where the “pumps” and “labor” constraints intersect. This occurs where: X 1 + X 2 = 200 (1) and 9X 1 + 6X 2 = 1566(2) From (1) we have, X 2 = 200 -X 1 (3) Substituting (3) for X 2 in (2) we have, 9X (200 -X 1 ) = 1566 which reduces to X 1 = 122 So the optimal solution is, X 1 =122, X 2 =200-X 1 =78 Total Profit = $350*122 + $300*78 = $66,100

1-21 Enumerating The Corner Points X2X2 X1X (0, 180) (174, 0) (122, 78) (80, 120) (0, 0) obj. value = $54,000 obj. value = $64,000 obj. value = $66,100 obj. value = $60,900 obj. value = $0 Note: This technique will not work if the solution is unbounded.

1-22 Summary of Graphical Solution to LP Problems 1. Plot the boundary line of each constraint 2. Identify the feasible region 3.Locate the optimal solution by either: a.Plotting level curves b. Enumerating the extreme points

1-23 Special Conditions in LP Models A number of anomalies can occur in LP problems: –Alternate Optimal Solutions –Redundant Constraints –Unbounded Solutions –Infeasibility

1-24 Example of Alternate Optimal Solutions X2X2 X1X X X 2 = objective function level curve alternate optimal solutions

1-25 Example of a Redundant Constraint X2X2 X1X boundary line of tubing constraint Feasible Region boundary line of pump constraint boundary line of labor constraint

1-26 Example of an Unbounded Solution X2X2 X1X X 1 + X 2 = 400 X 1 + X 2 = 600 objective function X 1 + X 2 = 800 objective function -X 1 + 2X 2 = 400

1-27 Example of Infeasibility X2X2 X1X X 1 + X 2 = 200 X 1 + X 2 = 150 feasible region for second constraint feasible region for first constraint

1-28 Important ”Behind the Scenes” Assumptions in LP Models

1-29 Proportionality and Additivity Assumptions An LP objective function is linear; this results in the following 2 implications:  proportionality: contribution to the objective function from each decision variable is proportional to the value of the decision variable. e.g., contribution to profit from making 4 aqua-spas is 4 times the contribution from making 1 aqua-spa ($350)

1-30 Proportionality and Additivity Assumptions (cont.)  Additivity: contribution to objective function from any decision variable is independent of the values of the other decision variables. E.g., no matter what the value of x 2, the manufacture of x 1 aqua-spas will always contribute 350 x 1 dollars to the objective function.

1-31 Proportionality and Additivity Assumptions (cont.) Analogously, since each constraint is a linear inequality or linear equation, the following implications result:  proportionality: contribution of each decision variable to the left-hand side of each constraint is proportional to the value of the variable. E.g., it takes 3 times as many labor hours hours) to make 3 aqua-spas as it takes to make 1 aqua-spa hours) [No economy of scale]

1-32 Proportionality and Additivity Assumptions (cont.)  Additivity: the contribution of a decision variable to the left-hand side of a constraint is independent of the values of the other decision variables. E.g., no matter what the value of x 1 (no. of aqua- spas produced), the production of x 2 hydro-luxes uses x 2 pumps, 6x 2 hours of labor, 16x 2 feet of tubing.

1-33 More Assumptions Divisibility Assumption: each decision variable is allowed to assume fractional values Certainty Assumption: each parameter (objective function coefficient cj, right-hand side constant bi of each constraint, and technology coefficient aij) is known with certainty.

1-34 End of Chapter 1