The ABC’s of Optimization

Slides:



Advertisements
Similar presentations
Max output (Q) subject to a cost constraint
Advertisements

Solving LP Models Improving Search Special Form of Improving Search
Solving IPs – Cutting Plane Algorithm General Idea: Begin by solving the LP relaxation of the IP problem. If the LP relaxation results in an integer solution,
Understanding optimum solution
Lesson 08 Linear Programming
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
Operations Management Linear Programming Module B - Part 2
Linear Programming Using the Excel Solver
Lecture 7: Linear Programming in Excel AGEC 352 Spring 2011 – February 9, 2011 R. Keeney.
Basic Linear Programming Concepts Lecture 2 (4/1/2015)
QM B Linear Programming
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Computational Methods for Management and Economics Carla Gomes Module 4 Displaying and Solving LP Models on a Spreadsheet.
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.
Linear-Programming Applications
3 Components for a Spreadsheet Linear Programming Problem There is one cell which can be identified as the Target or Set Cell, the single objective of.
Graphical Solutions Plot all constraints including nonnegativity ones
START EXCEL BUILD OR RETRIEVE YOUR OPTIMIZATION MODEL SAVE YOUR WORKBOOK!! CHOOSE “Solver…” IN THE “Tools” MENU SPECIFY IN SOLVER DIALOG BOX: 1.CELL TO.
Chapter 19 Linear Programming McGraw-Hill/Irwin
Linear Programming Chapter 13 Supplement.
STDM - Linear Programming 1 By Isuru Manawadu B.Sc in Accounting Sp. (USJP), ACA, AFM
We can make Product1 and Product2. There are 3 resources; Resource1, Resource2, Resource3. Product1 needs one hour of Resource1, nothing of Resource2,
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
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.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
1 The Geometry of Linear Programs –the geometry of LPs illustrated on GTC Handouts: Lecture Notes February 5, 2002.
Arben Asllani University of Tennessee at Chattanooga Chapter 5 Business Analytics with Goal Programming Business Analytics with Management Science Models.
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 Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
IE 312 Review 1. The Process 2 Problem Model Conclusions Problem Formulation Analysis.
MCCARL AND SPREEN TEXT CH. 2 T Y/MCCARL-BRUCE/BOOKS.HTM Lecture 2: Basic LP Formulation.
Linear Programming. George Dantzig 1947 NarendraKarmarkar Pioneers of LP.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Supply Chain Management By Dr. Asif Mahmood Chapter 9: Aggregate Planning.
Excel’s Solver Use Excel’s Solver as a tool to assist the decision maker in identifying the optimal solution for a business decision. Business decisions.
Introduction to Optimization
Chapter 12: Kay and Edwards
MID-TERM EXAM/REVISION
Linear Programming – Introduction
Solver & Optimization Problems
Chapter 19 – Linear Programming
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 5 Sensitivity Analysis: An Applied Approach
Wyndor Example; Enter data
Introduction to linear programming (LP): Minimization
The ABC’s of Optimization
Duality Theory and Sensitivity Analysis
Basic Linear Programming Concepts
DECISION MAKING Pongsa Pornchaiwiseskul
Integer Programming with What’sBest
Integer Programming with LINGO
A more complex LP problem
A more complex LP problem with What’sBest!
Modeling and Solving LP Problems in a Spreadsheet
Linear Programming Excel Solver.
A more complex LP problem
Integer Programming with What’sBest
BUS-221 Quantitative Methods
Linear Programming.
Presentation transcript:

The ABC’s of Optimization LSW1-1 The ABC’s of Optimization with What’sBest! LINDO Systems www.lindo.com

A Word from Our Sponsor LSW1-2 LINDO Systems supplies 3+ products: http://www.lindo.com supplies 3+ products: LSW1-2 What’sBest! Spreadsheet modeler LINGO Modeling language LINDO API Callable solver library Customized systems, SCM, Routing, Cutting stock, finance, etc.

A Word from Our Sponsor, cont. LSW1-3 Notable Features: LINDO API: Comprehensive and large scale solver engine. Solve Linear programs with millions of variables and constraints, using primal, dual, and/or barrier algorithms. Quadratic objective and quadratic constraints, all forms, e.g. V@R, Semi-Definite Programs/ Conic programs, Nonlinear models + Global solver, solve to guaranteed global optimality even if functions not convex, not continuous SP (Stochastic Programming) optimization under uncertainty, Integer variables allowed anywhere. LINGO: Easy to use, powerful, comprehensive modeling language with programming capability to automatically solve a series of related models. What’sBest!: Easy to use, large scale spreadsheet add-in optimizer giving all the power of LINDO API, including Global, to the spreadsheet user. New features for optimization under uncertainty.

The A B C's of Optimization   A) Identify the Adjustable cells, i.e., the decision variables B) How do we measure Best? i.e., specify an objective function, or criterion function C) What are the Constraints? i.e., the relationships that limit what we can do. Sometimes we are interested in: D) Dual prices, What is the value/unit of relaxing some constraint? LSW1-4

How much do we buy, produce, ship, carry LSW1-5   Typical variables: How much do we buy, produce, ship, carry in inventory; - from a specific vendor of a specific product in a specific period. Typical objectives: Maximize wealth at end of period T. Typical constraint: sources of a commodity = uses of a commodity, where commodity could be cash, labor, capacity, product, etc.

Example LSW1-6 Enginola Company makes 2 types of TV's:   Astro: Profit contribution(PC) = $20/unit, uses 1 hour of labor. Cosmo: PC = $30/unit, uses 2 hours of labor. Each product is produced on its own line with capacities: 60/day on Astro line, 50/day on Cosmo line. Labor availability is 120 hours/day. Some questions:  How much should we produce of each? How much are extra resources worth? of Astro capacity, Cosmo capacity, Labor capacity? LSW1-6

A) Decision variables: A = no. of Astros produced/day Model in words:   A) Decision variables: A = no. of Astros produced/day C = no. of Cosmo produced/day. B) Objective: Maximize profit contribution. C) Constraints: Astro production not to exceed 60, Cosmo production not to exceed 50, Labor usage not to exceed 120 hours. LSW1-7

Cosmo is more profitable/unit.... Astro makes more $/hour of labor.. LSW1-8   What would you recommend? Cosmo is more profitable/unit.... Astro makes more $/hour of labor.. What is the value of an additional hour of labor? $20, $15, $0?

Full Linear Program (LP) Max z= 20A+30C (Objective function) s.t. A <=60 (Astro production constraint) C <=50 (Cosmo production constraint) A +2C <=120 (Labor Usage) A >=0 (Nonnegativity constraint on A) C >=0 (Nonnegativity constraint on B) LSW1-9 feasible region Optimal Solution is?? Production problem using Graph Production problem using What’sBest 9

Graphical Version of Astro/Cosmo   If we have two or less decision variables, then the problem can be represented graphically. LSW1-10 50*30=1500 20*20=400 = 1900 50*30=1500 30*30=900 60*20=1200 = 2100 60*20=1200

An LP Model in What’sBest!   [1] MAX = 20 * A + 30 * C; [2][2] A <= 60; [3][3] C <= 50; [4][4] A + 2 * C <= 120;  LSW1-11 A = no. of Astro produced/day C = no. of Cosmo produced/day.

An LP Model in What’sBest!    LSW1-12 Decision variables: no. of Astro produce/ day no. of Cosmo produce/ day

An LP Model in What’sBest! LSW1-13    LSW1-13 Note : By default, What’sBest assumes the adjustable cells can be set to any non-negative value.

An LP Model in What’sBest! LSW1-14    LSW1-14 Make Adjustable : to specify the range indicated in the Refers To: Remove Adjustable : to return an adjustable cell to its fixed (non-adjustable) state. Make Adjustable & Free or Remove Free : to set them as adjustable and free (capable of assuming negative as well as positive values) or remove their free status.

An LP Model in What’sBest!    LSW1-15 Objective : To Maximize Profit Total Profit = (Qty of Astro produced * profit per unit of Astro) + (Qty of Cosmo produced * profit per unit of Cosmo)

An LP Model in What’sBest!    LSW1-16 To define the objective (best cell), move the cursor to that cell and choose or Or choose to define in dialog.

An LP Model in What’sBest!    LSW1-17 Constraints : Astro production not to exceed 60 Cosmo production not to exceed 50 Labor usage not to exceed 120 hours.

An LP Model in What’sBest! LSW1-18    LSW1-18 To specify the constraints, highlight the range E9:E11, then choose Constraints… Or choose to define in dialog.

An LP Model in What’sBest!    LSW1-19

An LP Model in What’sBest!    LSW1-20 Summarize what we have done so far: Adjustable: Best: Constraints: Then….Solve !!!

An LP Model in What’sBest!    LSW1-21 Solution : Total Profit = 2100 Qty to produce Astro = 60 Qty to produce Cosmo = 30

An LP Model in What’sBest!    LSW1-22

Economic Information in the Report   Economic Information in the Report Dual Price = value of an additional unit of the resource associated with the constraint. Reduced Cost = amount by which the cost per unit of the associated variable must be reduced to make it “competitive”. Alternatively: amount by which profit contribution must be increased, or reduction in profit if you force one unit of this variable into the solution. LSW1-23

Dual Prices and Reduced Costs  LSW1-24 Dual Price

Dual Prices and Reduced Costs LSW1-25 Dual Price = value of an additional unit of the resource associated with the constraint.

Dual Prices and Reduced Costs  LSW1-26 Reduced Cost

Dual Prices and Reduced Costs  LSW1-27 Reduced Cost

Dual Prices and Reduced Costs Enginola is considering the manufacture of a digital tape recorder. Producing one would require 1 unit of capacity on the Astro line, 1 unit of capacity on the Cosmo line, 3 hours of labor, Its profit contribution would be $47/unit   Is it worthwhile to produce the digital recorder(DR)? Recall, before DR came upon the scene: MAX = 20 * A + 30 * C; A <= 60; C <= 50; A + 2 * C <= 120; LSW1-28

Row Slack or Surplus Dual Price 1 2100.00000 1.000000 LSW1-29   Variable Value Reduced Cost A 60.00000 0.0000000 C 30.00000 0.0000000 Row Slack or Surplus Dual Price 1 2100.00000 1.000000 2 0.00000 5.000000 3 20.00000 0.000000 4 0.00000 15.000000 Observations: DR is most profitable product/unit. Its profit contribution per labor hour is better than Cosmo. But it does use more resources. Without re-solving, what do you recommend?

Dual Prices and Reduced Costs  LSW1-30 Recall the Astro-Cosmo example, add one more product, DR = number of digital recorders to produce, One DR gives $47 of profit contribution, uses 1 unit of capacity on Astro production line, uses 1 unit of capacity on Cosmo production line, uses 3 units of labor.

Dual Prices and Reduced Costs LSW1-31 Using WB! Tool bar : A) Mark B4:D4 as “Adjustable” (K->x)cells, B) Add DR in Total Profit, C) Constraints are added in cells F8:F10 D) Optimize by clicking on the red bullseye. Then….Solve !!!

Dual Prices and Reduced Costs  LSW1-32 Dual Price / Reduced Cost

The expanded formulation is: MAX = 20 * A + 30 * C + 47 * DR;   MAX = 20 * A + 30 * C + 47 * DR; A + DR <= 60; C + DR <= 50; A + 2 * C + 3 * DR <= 120;   with solution:   Variable Value Reduced Cost A 60.000000 0.0000000 C 30.000000 0.0000000 DR 0.000000 3.0000000 Row Slack or Surplus Dual Price 1 2100.000000 1.000000 2 0.000000 5.000000 3 20.000000 0.000000 4 0.000000 15.000000 LSW1-33

The Costing Out Operation/Reduced Costs   For activity DR: Row Coefficient Dual Price Coef*Price 1 -47.0 1.0 -47.0 2 1.0 5.0 5.0 3 1.0 0.0 0.0 4 3.0 15.0 45.0 --------- Net opportunity cost= 3.0 Note, we do everything in terms of cost, so we put a -47.0 in the objective row because the 47 is a profit contribution, which is equivalent to a cost of -47. The whole operation is stated terms of net opportunity cost. LSW1-34

Row Coefficient Dual Price Coef*Price 1 -20.0 1.0 -20.0 2 1.0 5.0 5.0   For activity A: Row Coefficient Dual Price Coef*Price 1 -20.0 1.0 -20.0 2 1.0 5.0 5.0 3 0.0 0.0 0.0 4 1.0 15.0 15.0 --------- Net opportunity cost= 0.0 So the Reduced Cost is the net opportunity cost of an activity, relative to the "incumbent" or “basic” activities. LSW1-35

Solution Methods We will say little about solution methods. We simply assume they work. For LP’s: a) Simplex method: Proceeds from one corner on the exterior to a better neighbor, until there is no better neighbor. b) Barrier method. Starts in the interior. Treats the constraint boundary as a barrier not to be crossed. Moves through the interior to the optimum. Good for typical large models. Details of implementation are trade secrets. LSW1-36

Thank you for your attention. For more information, please visit www.m-focus.co.th or Call 02-513-9892