Linear Programming last topic of the semester What is linear programming (LP)? Not about computer programming “Programming” means “planning” “Linear” refers.

Slides:



Advertisements
Similar presentations
Optimization problems using excel solver
Advertisements

Planning with Linear Programming
Linear Programming Problem
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Table of Contents Chapter 2 (Linear Programming: Basic Concepts) Three Classic Applications.
Linear Programming Models & Case Studies
Introduction to Management Science
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
Operations Management Linear Programming Module B - Part 2
Chapter 4: Linear Programming Presented by Paul Moore.
Linear Programming Using the Excel Solver
Managerial Decision Modeling with Spreadsheets
Chapter 8: Linear Programming
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Chapter 6 Linear Programming: The Simplex Method
2-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Chapter Topics Model Formulation A Maximization Model Example Graphical Solutions.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Three Classic Applications of LP Product Mix at Ponderosa Industrial –Considered limited.
Operations Management Dr. Ron Lembke
Linear Programming Excel Solver. MAX8X 1 + 5X 2 s.t.2X 1 + 1X 2 ≤ 1000 (Plastic) 3X 1 + 4X 2 ≤ 2400 (Prod. Time) X 1 + X 2 ≤ 700 (Total Prod.) X 1 - X.
QM B Linear Programming
Transportation Problems Dr. Ron Tibben-Lembke. Transportation Problems Linear programming is good at solving problems with zillions of options, and finding.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Table of Contents Chapter 2 (Linear Programming: Basic Concepts) The Wyndor Glass Company.
Computational Methods for Management and Economics Carla Gomes Module 4 Displaying and Solving LP Models on a Spreadsheet.
Linear Programming ISQA 459/559. Getting Started with LP Game problem Terms Algebraic & Graphical Illustration LP with Excel.
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 INTRODUCTION
Optimization I Operations -- Prof. Juran. Outline Basic Optimization: Linear programming –Graphical method –Spreadsheet Method Extension: Nonlinear programming.
Example 14.1 Introduction to LP Modeling. 14.1a14.1a | 14.2 | Linear Programming n Linear programming (LP) is a method of spreadsheet optimization.
Linear Programming The Industrial Revolution resulted in (eventually) -- large companies, large problems How to optimize the utilization of scarce resources?
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
Transportation Model Lecture 16 Dr. Arshad Zaheer
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
Chapter 12 Section 12.1 The Geometry of Linear Programming.
1 Chapter 8 Linear programming is used to allocate resources, plan production, schedule workers, plan investment portfolios and formulate marketing (and.
Product Mix Problem Monet company makes four types of frames.
On LT simulation Game ends at 8:45 p.m.
Spreadsheet Modeling of Linear Programming (LP). Spreadsheet Modeling There is no exact one way to develop an LP spreadsheet model. We will work through.
Linear Programming: Basic Concepts
We can make Product1 and Product2. There are 3 resources; Resource1, Resource2, Resource3. Product1 needs one hour of Resource1, nothing of Resource2,
0 A Toy Production Problem  How many units to produce from each product type in order to maximize the profit? ProductMan-PowerMachineProfit Type A3 h1.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
Introduction A GENERAL MODEL OF SYSTEM OPTIMIZATION.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
QMB 4701 MANAGERIAL OPERATIONS ANALYSIS
Linear Programming Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Route Planning Texas Transfer Corp (TTC) Case 1. Linear programming Example: Woodcarving, Inc. Manufactures two types of wooden toys  Soldiers sell for.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
Optimization I. © The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran2 Outline Basic Optimization: Linear programming –Graphical.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
3 Characteristics of an Optimization Problem General descriptionKPiller Illustration Decisions that must be made; represented by decision variables How.
Lab 3 Solver Add-In In Excel ► Lab 2 Review ► Solver Add-in Introduction ► Practice Solver following Instructor » Saferly Inc.
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
OSCM 230 Fall 2013 Management Science Lecture 4 Linear Programming II 9/11/2013, 9/16/ Lecture 4 Linear Programming II Professor Dong Washington.
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.
OPSM 301 Operations Management Class 13&14: Linear Programming using Excel Koç University Zeynep Aksin
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.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
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.
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.
Chapter 4: Linear Programming Lesson Plan
Operations Management Linear Programming Module B
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Wyndor Example; Enter data
Introduction to linear programming (LP): Minimization
Chapter 5 Transportation, Assignment, and Transshipment Problems
Presentation transcript:

Linear Programming last topic of the semester What is linear programming (LP)? Not about computer programming “Programming” means “planning” “Linear” refers to the nature of the mathematical relationships involved, i.e., all relationships are defined by lines So linear programming is about planning, or making decisions, when the mathematical relationships are linear

Linear Programming (cont’d) What sets LP apart from other topics we’ve discussed? There is no probability in LP; it is “deterministic” There is a definitive way to judge the best decision (based on your model) It actually tells you the best decision (based on your model) More than any other topic so far, LP is about you making good models of business situations

Linear Programming (cont’d) A little history… LP was first recognized and solved by George Dantzig using the “simplex method” in 1947 at the Pentagon based on his planning during WWII LP was not really useful at the time because computers were too slow; it took until 1955 before benefits were realized Since then, the use of LP has grown tremendously along with the growth of computers All sorts of industries (manufacturing, financial, service, health, etc.) now use LP to plan their operations…

First Example The furniture company you work for manufactures two types of beds: Your company currently has 1200 and 700 units of wood and metal available, respectively Producing how many of each bed yields the most profit, assuming sufficient demand? Bed ABed B Profit$20$45 Wood12 units Metal6 units10 units

First Example (cont’d) The furniture company you work for manufactures two specific collections of bedroom furniture: Bed ABed B Profit$20$45 Wood12 units Metal6 units10 units Your company currently has 1200 and 700 units of wood and metal available, respectively Producing how many of each bed yields the most profit, assuming sufficient demand? A = # produced of Bed A B = # produced of Bed B maximize 20*A + 45*B subject to 12*A + 12*B  *A + 10*B  700 A  0, B  0 decision variables objective function constraints nonnegativity constraints right-hand sides

LP Definitions Decision Variables The quantities that are unknown but we wish to determine All other quantities in the situation depend on the decision variables (e.g., profit, resources used) Every linear program has decision variables, and they must be identified ASAP in the modeling process Objective Function The quantity that we would like to maximize or minimize (e.g., profit or cost) Written as a linear expression of the decision variables

LP Definitions (cont’d) Constraints The limitations imposed on the decision variables Written as a linear expression of decision variables that is , =, or  some number; that “some number” is called the right-hand side Nonnegativity Constraints Special constraints that say the decision variables must be restricted to taking on nonnegative values (0 or positive, not negative) A very natural constraint that occurs in most LP problems Since nonnegativity constraints are very common, we will assume them unless otherwise stated

First Example in Excel (see Excel) I strongly suggest to setup your LP in Excel like I have –Top left section has decision variables in columns (colored cells) –Bottom left section has objective function and constraints in columns that match the decision variables, plus right-hand sides for constraints –Bottom right section has actual results for decision variables (colored cells), lined up with objective function and constraints; use the SUMPRODUCT Excel command to do these calculations –All labels in the same places

First Example in Excel (cont’d) Then go to Tools > Solver and fill in information –Target Cell: the colored cell that contains actual objective function –Max or Min: depending on how you want to optimize –By Changing Cells: array of colored decision variables –Subject to the Constraints: the colored cells , =, or  the corresponding rhs, as appropriate; constraints can be done in groups or one-by-one –Options > Assume Linear Model: check this box –Options > Assume Non-Negative: check this box Then click Solve and save Answer Report

Bank Cashy Bank Cashy has only two types of assets, loans (X) and investments (Y). A total of $700 million is to be allocated between X and Y. Bank Cashy wishes its loans to equal at least $300 million and its investments to be at least 30% of the total of X + Y. The bank earns 12% on its loans and 14% on its investments. Formulate the LP to maximize earnings, and then setup and solve the model in Excel (see whiteboard and Excel)

Bank Cashy (cont’d) This model brings up an important point For your Excel model, it is necessary to transfer each of your constraints to a “standard form”: Y  0.3 ( X + Y ) Y  0.3 X Y-0.3 X Y  0 “all the decision variables on one side”

Some Other Things to Watch Out For When solver finishes, it gives you one of three messages: “Solver found a solution.” (good!) “Solver could not find a feasible solution.” (bad) “The Set Cells values do not converge.” (bad) When either of the last two occur, most likely something is wrong with your model. Double-check it for errors!

Transportation LP Problems A transportation LP problem is a special type of LP that involves the transportation of goods from supply nodes to demand nodes S1S1 S2S2 S3S3 D1D1 D2D2 D3D3 D4D4 s1s1 s2s2 s3s3 d1d1 d2d2 d3d3 d4d4 Decision vars are the arrows – how much Si gives to Dj c 11 c 34 cij is the cost of shipping one unit from Si to Dj Objective is to minimize total cost of meeting all demands

Transportation LP Problems (cont’d) min c 11 x 11 + c 12 x 12 + c 13 x 13 + c 14 x 14 + c 21 x 21 + c 22 x 22 + c 23 x 23 + c 24 x 24 + c 31 x 31 + c 32 x 32 + c 33 x 33 + c 34 x 34 + c 41 x 41 + c 42 x 42 + c 43 x 43 + c 44 x 44 s.t.x 11 + x 12 + x 13 + x 14  s 1 x 21 + x 22 + x 23 + x 24  s 2 x 31 + x 32 + x 33 + x 34  s 3 x 11 + x 21 + x 31  d 1 x 12 + x 22 + x 32  d 2 x 13 + x 23 + x 33  d 3 x 14 + x 24 + x 34  d 4 (nonnegativity) Supply constraints Demand constraints Note: Feasible only if total supply exceeds total demand!

Pluckett Company The J.F. Pluckett Company manufactures furnaces at three different plants and sells these furnaces at four different sales outlets. The number of furnaces constructed at each plant is 10, 15, and 11. Company policy requires that nine furnaces per week be sent to each sales outlet. The problem is to determine a shipping schedule for the furnaces (from plants to outlets) that minimizes total transportation costs. The transportation cost for shipping a single furnace from each of the three plants to each of the four outlets is shown here (in dollars). Outlet Plant1234Supply Demand9999 Find the shipping schedule that minimizes costs per week. (see whiteboard and Excel)

Pluckett Company (cont’d) This problem brings up another good point Even if your hand-written model doesn’t include every decision variable in each constraint, your Excel model has to. Those “missing” variables will just have a 0 in Excel

Refrigerators Two models of GE side-by-side refrigerators are produced at the GE plant in Bloomington: Model A and Model B. No more than 100 of these two models can be produced (i.e., the sum of A and B cannon exceed 100). Company policy is to produce at least as many of Model A as Model B. You are given the following information. Model AModel B Selling price$1,200$1,400 Cost of materials$400$500 Cost of labor$300 Per-unit overhead$100$150 Formulate and solve an LP to maximize profit. (see whiteboard and Excel)

Fertilizer The Grow-Tall Fertilizer Company is considering mixing its four current fertilizer products in various amounts to form a new fertilizer with some desired properties. The current products are: Product 1234 % Potash % Nitrogen22046 % Phosphate Company’s cost per pound $0.30$0.60$0.15$0.20 (The remaining percentage of each product is a neutral base.) The new fertilizer should be a minimum 11% composed of each of the three main ingredients, but should meet these requirements at minimum cost. Formulate and solve an LP to determine how the four current products should be combined to form the new product. (see whiteboard and Excel)