Línuleg bestun Hámörkun, dæmi Lágmörkun, dæmi

Slides:



Advertisements
Similar presentations
Applications of Optimization To Operations Management
Advertisements

Operations Management For Competitive Advantage © The McGraw-Hill Companies, Inc., 2001 C HASE A QUILANO J ACOBS ninth edition 1 Process Analysis Operations.
Optimization problems using excel solver
Chapter 3: Linear Programming Modeling Applications © 2007 Pearson Education.
Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
IENG442 LINGO LAB3.
Question:- A company assembles four products (1, 2, 3, 4) from delivered components. The profit per unit for each product (1, 2, 3, 4) is £10, £15, £22.
Integer Linear Programming
Linear Programming Problem
Session II – Introduction to Linear Programming
Linear Programming Problem Formulation.
Operations Management For Competitive Advantage © The McGraw-Hill Companies, Inc., 2001 C HASE A QUILANO J ACOBS ninth edition 1 Operations Strategy and.
Operations Management For Competitive Advantage © The McGraw-Hill Companies, Inc., 2001 C HASE A QUILANO J ACOBS ninth edition 1 Aggregate Planning Operations.
8/27: Linear Programming Lecture: LP Small Groups Homework.
Linear Programming Using the Excel Solver
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
19 Linear Programming CHAPTER
Linear Programming Example 5 Transportation Problem.
Operations Management For Competitive Advantage © The McGraw-Hill Companies, Inc., 2001 C HASE A QUILANO J ACOBS ninth edition 1 The AHP Method  Multi.
Operations Management For Competitive Advantage © The McGraw-Hill Companies, Inc., 2001 C HASE A QUILANO J ACOBS ninth edition 1 Types of Processes  Conversion.
Operations Management For Competitive Advantage © The McGraw-Hill Companies, Inc., 2001 C HASE A QUILANO J ACOBS ninth edition 1 Facility Location Operations.
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
Operations Management For Competitive Advantage © The McGraw-Hill Companies, Inc., 2001 C HASE A QUILANO J ACOBS ninth edition 1 Decision Trees  Used.
Operations Management For Competitive Advantage © The McGraw-Hill Companies, Inc., 2001 C HASE A QUILANO J ACOBS ninth edition 1 Kafli 11tn í Chase … Flutningar.
B-1 Operations Management Linear Programming Module B.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
INTRODUCTION TO LINEAR PROGRAMMING
Operations Management For Competitive Advantage © The McGraw-Hill Companies, Inc., 2001 C HASE A QUILANO J ACOBS ninth edition 1 Learning Curves Operations.
Operations Management For Competitive Advantage © The McGraw-Hill Companies, Inc., 2001 C HASE A QUILANO J ACOBS ninth edition 1 Kafli 6 í Chase Vöruþróun.
Linear Programming Example 2 Alternate Optimal Solutions.
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
Linear Programming Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Linear programming is a strategy for finding the.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
On LT simulation Game ends at 8:45 p.m.
Linear Programming Chapter 13 Supplement.
Ardavan Asef-Vaziri Systems and Operations Management
Module B: Linear Programming
Lecture 1 Modeling: Linear Programming I
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
 A concert promoter wants to book a rock group for a stadium concert. A ticket for admission to the stadium playing field will cost $125, and a ticket.
In The Name Of Allah Lab 07 ins. Tahani Aldweesh.
Route Planning Texas Transfer Corp (TTC) Case 1. Linear programming Example: Woodcarving, Inc. Manufactures two types of wooden toys  Soldiers sell for.
Optimization I. © The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran2 Outline Basic Optimization: Linear programming –Graphical.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
Introduction to linear programming:- - Linear programming (LP) applies to optimization models in which the objective and constraints functions are strictly.
1 The Geometry of Linear Programs –the geometry of LPs illustrated on GTC Handouts: Lecture Notes February 5, 2002.
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.
Linear Programming Ex1) Use the system of constraints below to maximize the objective function z = -0.4x + 3.2y. Corner Points.
OPSM 301 Operations Management Class 13&14: Linear Programming using Excel Koç University Zeynep Aksin
LINEAR PROGRAMMING.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Systems of Inequalities in Two Variables. Graph of an Inequality Systems of Inequalities Linear Programming … and why Linear programming is used in.
Copyright © 2015 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Section 7.4 Linear Programming Math in Our World.
Chapter 3 Introduction to Linear Programming to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c)
Linear Programming Applications
Operations Management For Competitive Advantage © The McGraw-Hill Companies, Inc., 2001 C HASE A QUILANO J ACOBS ninth edition 1 Kafli 17 í Chase … Verkröðun.
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 2 Linear Programming Models: Graphical and Computer Methods
Linear Programming Models: Graphical and Computer Methods
Presentation by Team 2.
Linear Programming Objectives: Set up a Linear Programming Problem
Kafli 11 í Chase … Ákvarðanir um afkastagetu
Technical Note 6 Fyrirkomulag reksturs (Layout)
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
10.8 Linear Programming.
1.6 Linear Programming Pg. 30.
Case 2:( Model Construction):
Section 7.5 Linear Programming.
Presentation transcript:

Línuleg bestun Hámörkun, dæmi Lágmörkun, dæmi Kafli 2Tn í Chase … Línuleg bestun (Linear Programming) með Excel Solver Línuleg bestun Hámörkun, dæmi Lágmörkun, dæmi 2

Línuleg bestun Notuð við flókin ákvörðunarvandamál þegar aðföng (forðar) eru takmarkaðir og geta verið flöskuhálsar. LP reiknilíkön hafa markfall (objective function) Hámörkun hagnaðar eða lágmörkun kostnaðar m.t.t. skorða á aðföngum gefur bestu gildi á ákvarðanabreytum. Bæði markfall og skorður verða að vera línuleg föll. Breytur verða að vera samfelldar (ekki heiltölur) og ekki neikvæðar. 3

Markfall (Objective Function) Max (eða Min) Z = C1X1 + C2X2 + ... + CnXn Cj eru stuðlar sem lýsa framlegð eða hagnaði eða kostnaði á einingu af Xj sem getur t.d. verið framleitt magn af vöru. Z er heildar framlegð eða hagnaður eða kostnaður af öllum vörum. 5

Skorður (Constraints) A11X1 + A12X2 + ... + A1nXnB1 A21X1 + A22X2 + ... + A2nXn B2 : AM1X1 + AM2X2 + ... + AMnXn=BM Aij er þörf vöru nr. j (ákvarðanabreytu Xj) fyrir aðföng (resource) nr. i. Bi lýsir hve mikið er fyrir hendi af aðföngum nr. i. Skorðurnar geta verið , , eða = . 5

Breytur ekki neikvæðar (Non-Negativity) X1,X2, …, Xn  0 Öll LP-líkön byggja á því að breyturnar séu ekki neikvæðar. Við teljum þessar kröfur þó ekki með skorðum. 5

Dæmi um hámörkun Now let’s formulate this problem. LawnGrow Manufacturing Company must determine the mix of its commercial riding mower products to be produced next year. The company produces two product lines, the Max and the Multimax. The average profit is $400 for each Max and $800 for each Multimax. Fabrication and assembly are limited resources. There is a maximum of 5,000 hours of fabrication capacity available per month (Each Max requires 3 hours and each Multimax requires 5 hours). There is a maximum of 3,000 hours of assembly capacity available per month (Each Max requires 1 hour and each Multimax requires 4 hours). Question: How many of each riding mower should be produced each month in order to maximize profit? Now let’s formulate this problem. 6

Markfall If we define the Max and Multimax products as the two decision variables X1 and X2, and since we want to maximize profit, we can state the objective function as follows: 8

Skorður Given the resource information below from the problem: We can now state the constraints and non-negativity requirement a: Note that the inequalities are less-than-or-equal since the time resources represent the total available resources for production. 9

Lausn Produce 715 Max and 571 Multimax per month for a profit of $742,800. 16

Dæmi um lágmörkun HiTech Metal Company is developing a plan for buying scrap metal for its operations. HiTech receives scrap metal from two sources, Hasbeen Industries and Gentro Scrap in daily shipments using large trucks. Each truckload of scrap from Hasbeen yields 1.5 tons of zinc and 1 ton of lead at a cost of $15,000. Each truckload of scrap from Gentro yields 1 ton of zinc and 3 tons of lead at a cost of $18,000. HiTech requires at least 6 tons of zinc and at least 10 tons of lead per day. Question: How many truckloads of scrap should be purchased per day from each source in order to minimize scrap metal cost? Now let’s formulate this problem. 17

Markfall Minimize Z = 15,000 X1 + 18,000 X2 Hasbeen Gentro Where If we define the Hasbeen truckloads and the Gentro truckloads as the two decision variables X1 and X2, and since we want to minimize cost, we can state the objective function as follows: Minimize Z = 15,000 X1 + 18,000 X2 Where Z = daily scrap cost X1 = truckloads from Hasbeen X2 = truckloads from Gentro Hasbeen Gentro 18

Skorður Given the demand information below from the problem: We can now state the constraints and non-negativity requirement a: 1.5X1 + X2 > 6 (Zinc/tons) X1 + 3X2 > 10 (Lead/tons) X1, X2 > 0 (Non-negativity) Note that the inequalities are greater-than-or-equal since the demand information represent the minimum necessary for production. 19

Lausn Order 2.29 truckloads from Hasbeen and 2.57 truckloads from Gentro for daily delivery. The daily cost will be $80,610. 25

Túlkun bestu lausnar Gildi á ákvörðunarbreytum og markfalli, t.d. Hve mikið á að framleiða og hvað það gefur í heildar framlegð Slakar = ónotuð aðföng Skuggaverð (stök í markfallsröð undir slakbreytum) = jaðarbreyting markfalls m.v. jaðarbreytingu á aðföngum (hægri hlið), þ.e. hvers virði er viðbótareining aðfanga.

Dæmi: Pakkningaval í fiskvinnslu