Optimization I. © The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran2 Outline Basic Optimization: Linear programming –Graphical.

Slides:



Advertisements
Similar presentations
Optimization problems using excel solver
Advertisements

Using Solver to solve a minimization LP + interpretation of output BSAD 30 Dave Novak Source: Anderson et al., 2013 Quantitative Methods for Business 12.
Session II – Introduction to Linear Programming
OPS 301 Module B and Additional Topics in Linear Programming
Session 3a Decision Models -- Prof. Juran.
Linear Programming Problem Formulation.
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
Operations Management Linear Programming Module B - Part 2
Linear Programming Using the Excel Solver
Session 2b. Decision Models -- Prof. Juran2 Overview More Sensitivity Analysis –Solver Sensitivity Report More Malcolm Multi-period Models –Distillery.
Chapter 6 Linear Programming: The Simplex Method
Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Return and Risk: The Capital Asset Pricing Model (CAPM) Chapter.
Workshop in Financial Engineering “The Stock Game” Dr. J. René Villalobos, Joel Polanco and Marco A. Gutierrez Industrial Engineering Dept. Arizona State.
The Transportation and Assignment Problems
Session 4b. Decision Models -- Prof. Juran2 Overview More Network Flow Models Facility Location Example Locating Call Centers Nonlinearity.
Asset Allocation Week 4. Asset Allocation: The Fundamental Question How do you allocate your assets amongst different assets ? –There are literally thousands.
Session 1a. Decision Models -- Prof. Juran2 Overview Web Site Tour Course Introduction.
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 99 Chapter 4 The Simplex Method.
Session 5a Decision Models -- Prof. Juran.
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
Session 1b. Decision Models -- Prof. Juran2 Overview Spreadsheet Conventions Copying, Pasting, Reporting Introduction to Solver.
Linear-Programming Applications
Optimization I Operations -- Prof. Juran. Outline Basic Optimization: Linear programming –Graphical method –Spreadsheet Method Extension: Nonlinear programming.
Linear Programming Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Linear programming is a strategy for finding the.
Linear Programming.
Optimization II. © The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran2 Outline Optimization Extensions Multiperiod Models –Operations.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Introduction to Linear Programming
Chapter 3 Introduction to Optimization Modeling
Portfolio Allocation Model How to invest in different asset classes? Different people have different objectives/goals. Returns from investments are inherently.
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
Chapter 19 Linear Programming McGraw-Hill/Irwin
Linear Programming Chapter 13 Supplement.
Classifying optimization problems By the independent variables: –Integer optimization --- integer variables –Continuous optimization – real variables By.
Linear Programming: Basic Concepts
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
STDM - Linear Programming 1 By Isuru Manawadu B.Sc in Accounting Sp. (USJP), ACA, AFM
Chapter Diversification and Risky Asset Allocation McGraw-Hill/IrwinCopyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved. 11.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Table of Contents Chapter 5 (What-If Analysis for Linear Programming) Continuing the Wyndor.
Table of Contents Chapter 5 (What-If Analysis for Linear Programming) Continuing the Wyndor Case Study (Section 5.2)5.2 Changes in One Objective Function.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
5-1 Wyndor (Before What-If Analysis). 5-2 Using the Spreadsheet to do Sensitivity Analysis The profit per door has been revised from $300 to $200. No.
QMB 4701 MANAGERIAL OPERATIONS ANALYSIS
1 Systems Analysis Methods Dr. Jerrell T. Stracener, SAE Fellow SMU EMIS 5300/7300 NTU SY-521-N NTU SY-521-N SMU EMIS 5300/7300 Statistical Analysis Other.
Linear Programming Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Linear Programming last topic of the semester What is linear programming (LP)? Not about computer programming “Programming” means “planning” “Linear” refers.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
Systems Analysis Methods
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
Risk Analysis & Modelling
Arben Asllani University of Tennessee at Chattanooga Business Analytics with Management Science Models and Methods Chapter 2 Introduction to Linear Programming.
Math Programming Concept of Optimization (L.O. a ) Linear Programming Managerial Value of Information (L.O. d) Theory (L.O. b) Example Applications (L.O.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
3 Components for a Spreadsheet Optimization Problem  There is one cell which can be identified as the Target or Set Cell, the single objective of the.
LINEAR PROGRAMMING.
OPSM 301 Operations Management Class 11: Linear Programming using Excel Koç University Zeynep Aksin
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
Bonus Problem 1. Decision Models -- Prof. Juran2 Optimization Example: Malcolm’s Glass Shop.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Appendix A with Woodruff Edits Linear Programming Using the Excel Solver Copyright © 2010 by The McGraw-Hill Companies, Inc. All rights reserved.McGraw-Hill/Irwin.
Linear Programming.
Analysis Using Spreadsheets
Linear Programming Dr. T. T. Kachwala.
Lecture 6 General Overview of Non-Linear Programming
Optimization II.
Session 1a Decision Models -- Prof. Juran.
Optimization I.
Presentation transcript:

Optimization I

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran2 Outline Basic Optimization: Linear programming –Graphical method –Spreadsheet Method Extension: Nonlinear programming –Portfolio optimization

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran3 What is Optimization? A model with a “best” solution Strict mathematical definition of “optimal” Usually unrealistic assumptions Useful for managerial intuition

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran4 Elements of an Optimization Model Formulation –Decision Variables –Objective –Constraints Solution –Algorithm or Heuristic Interpretation

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran5 Optimization Example: Extreme Downhill Co.

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran6 1. Managerial Problem Definition Michele Taggart needs to decide how many sets of skis and how many snowboards to make this week.

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran7 2. Formulation a. Define the choices to be made by the manager ( decision variables ). b. Find a mathematical expression for the manager's goal ( objective function ). c. Find expressions for the things that restrict the manager's range of choices ( constraints ).

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran8 2a: Decision Variables

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran9

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran10

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran11 2b: Objective Function Find a mathematical expression for the manager's goal ( objective function ).

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran12 EDC makes $40 for every snowboard it sells, and $60 for every pair of skis. Michele wants to make sure she chooses the right mix of the two products so as to make the most money for her company.

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran13 What Is the Objective?

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran14

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran15

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran16

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran17

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran18 2c: Constraints Find expressions for the things that restrict the manager's range of choices ( constraints ).

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran19 Molding Machine Constraint The molding machine takes three hours to make 100 pairs of skis, or it can make 100 snowboards in two hours, and the molding machine is only running hours every week. The total number of hours spent molding skis and snowboards cannot exceed

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran20 Molding Machine Constraint

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran21

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran22 Cutting Machine Constraint Michele only gets to use the cutting machine 51 hours per week. The cutting machine can process 100 pairs of skis in an hour, or it can do 100 snowboards in three hours.

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran23 Cutting Machine Constraint

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran24

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran25 Delivery Van Constraint There isn't any point in making more products in a week than can fit into the van The van has a capacity of 48 cubic meters. 100 snowboards take up one cubic meter, and 100 sets of skis take up two cubic meters.

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran26 Delivery Van Constraint

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran27

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran28 Demand Constraint Michele has decided that she will never make more than 1,600 snowboards per week, because she won't be able to sell any more than that.

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran29 Demand Constraint

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran30

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran31 Non-negativity Constraints Michele can't make a negative number of either product.

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran32 Non-negativity Constraints

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran33

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran34

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran35

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran36 Solution Methodology Use algebra to find the best solution. (Simplex algorithm)

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran37

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran38

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran39

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran40 Calculating Profits

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran41 The Optimal Solution Make 1,860 sets of skis and 1,080 snowboards. Earn $154,800 profit.

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran42

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran43

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran44 Spreadsheet Optimization

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran45

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran46

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran47

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran48

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran49

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran50 Most important number: Shadow Price The change in the objective function that would result from a one-unit increase in the right-hand side of a constraint

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran51 Nonlinear Example: Scenario Approach to Portfolio Optimization Use the scenario approach to determine the minimum- risk portfolio of these stocks that yields an expected return of at least 22%, without shorting.

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran52 The percent return on the portfolio is represented by the random variable R. In this model, x i is the proportion of the portfolio (i.e. a number between zero and one) allocated to investment i. Each investment i has a percent return under each scenario j, which we represent with the symbol r ij.

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran53

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran54 The portfolio return under any scenario j is given by:

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran55 Let P j represent the probability of scenario j occurring. The expected value of R is given by: The standard deviation of R is given by:

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran56 In this model, each scenario is considered to have an equal probability of occurring, so we can simplify the two expressions:

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran57 Decision Variables We need to determine the proportion of our portfolio to invest in each of the five stocks. Objective Minimize risk. Constraints All of the money must be invested.(1) The expected return must be at least 22%.(2) No shorting.(3) Managerial Formulation

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran58 Mathematical Formulation Decision Variables x 1, x 2, x 3, x 4, and x 5 (corresponding to Ford, Lilly, Kellogg, Merck, and HP). Objective Minimize Z = Constraints (1) (2) For all i, x i ≥ 0(3)

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran59

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran60 The decision variables are in F2:J2. The objective function is in C3. Cell E2 keeps track of constraint (1). Cells C2 and C5 keep track of constraint (2). Constraint (3) can be handled by checking the “Unconstrained Variables Non-negative” box.

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran61

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran62

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran63 Invest 17.3% in Ford, 42.6% in Lilly, 5.4% in Kellogg, 10.5% in Merck, and 24.1% in HP. The expected return will be 22%, and the standard deviation will be 12.8%. Conclusions

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran64 2. Show how the optimal portfolio changes as the required return varies.

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran65

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran66

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran67 3. Draw the efficient frontier for portfolios composed of these five stocks.

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran68

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran69 Repeat Part 2 with shorting allowed.

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran70

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran71

© The McGraw-Hill Companies, Inc., Invest in Vanguard mutual funds under university retirement plan No shorting Max 8 mutual funds Rebalance once per year Tools used: Excel Solver Basic Stats (mean, stdev, correl, beta, crude version of CAPM) Juran’s Lazy Portfolio Decision Models -- Prof. Juran

© The McGraw-Hill Companies, Inc., Decision Models -- Prof. Juran

© The McGraw-Hill Companies, Inc., Decision Models -- Prof. Juran

© The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran75 Summary Basic Optimization: Linear programming –Graphical method –Spreadsheet Method Extension: Nonlinear programming –Portfolio optimization