Linear Programming :Applications Pertemuan 6 Matakuliah: K0442-Metode Kuantitatif Tahun: 2009.

Slides:



Advertisements
Similar presentations
PowerPoint Slides by Robert F. BrookerCopyright (c) 2001 by Harcourt, Inc. All rights reserved. Linear Programming Mathematical Technique for Solving Constrained.
Advertisements

BA 452 Lesson A.11 Other Advanced Applications 1 1ReadingsReadings Chapter 5 Advanced Linear Programming Applications.
Chapter 3: Linear Programming Modeling Applications © 2007 Pearson Education.
Managerial Decision Modeling with Spreadsheets
1 1 Slide © 2005 Thomson/South-Western Slides Prepared by JOHN S. LOUCKS ST. EDWARD’S UNIVERSITY.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
Planning with Linear Programming
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved DSCI 3870 Chapter 5 ADVANCED LP APPLICATIONS Additional Reading Material.
Linear Programming Problem
Linear Programming Problem Formulation.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
Linear Programming Applications in Marketing, Finance and Operations
Chapter 6 Linear Programming: The Simplex Method
4-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Modeling Examples Chapter 4.
Q 4 – 1 a. Let T = number of TV advertisements
Linear Programming (6S) and Transportation Problem (8S)
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
1 Lecture 2 MGMT 650 Linear Programming Applications Chapter 4.
Introduction to Management Science
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Example 15.2 Blending Oil Products at Chandler Oil
Socially Responsible Investing (SRI) Value-Based or “Ethical” mutual funds: –Create screens to prevent investment in organizations that promote or participate.
 Marketing Application  Media Selection  Financial Application  Portfolio Selection  Financial Planning  Product Management Application  Product.
1 1 Slides by John Loucks St. Edward’s University Modifications by A. Asef-Vaziri.
Slides by John Loucks St. Edward’s University.
1 1 Slides by John Loucks St. Edward’s University Modifications by A. Asef-Vaziri.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
BA 452 Lesson A.8 Marketing and Finance Applications 1 1ReadingsReadings Chapter 4 Linear Programming Applications in Marketing, Finance, and Operations.
Linear Programming Modeling
Product Mix Problem Monet company makes four types of frames.
1 1 Slide Chapter 4 Linear Programming Applications nBlending Problem nPortfolio Planning Problem nProduct Mix Problem.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming: Applications Chapter 4.
Chapter 3: Linear Programming Modeling Applications
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
1 1 Slide © 2005 Thomson/South-Western Chapter 4 Linear Programming Applications n Portfolio Planning Problem n Product Mix Problem n Blending Problem.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Linear Programming.  Linear Programming provides methods for allocating limited resources among competing activities in an optimal way.  Any problem.
Types of IP Models All-integer linear programs Mixed integer linear programs (MILP) Binary integer linear programs, mixed or all integer: some or all of.
Lecture 1 Modeling: Linear Programming I
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Linear Programming: Sensitivity Analysis and Interpretation of Solution Pertemuan 5 Matakuliah: K0442-Metode Kuantitatif Tahun: 2009.
Managerial Decision Modeling with Spreadsheets
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
PowerPoint Slides by Robert F. BrookerHarcourt, Inc. items and derived items copyright © 2001 by Harcourt, Inc. Managerial Economics in a Global Economy.
Modeling and Solving LP Problems in a Spreadsheet Chapter 3 © 2014 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
LINEAR PROGRAMMING APPLICATIONS IN MARKETING, FINANCE, AND OPERATIONS MANAGEMENT (2/3) Chapter 4 MANGT 521 (B): Quantitative Management.
MANGT 521 (B): Quantitative Management
Modeling and Solving LP Problems in a Spreadsheet Chapter 3 © 2014 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Data Envelope Analysis (DEA)
LINEAR PROGRAMMING.
Linear Programming Department of Business Administration FALL by Asst. Prof. Sami Fethi.
LINEAR PROGRAMMING MEANING:
LINEAR PROGRAMMING. Linear Programming Linear programming is a mathematical technique. This technique is applied for choosing the best alternative from.
 Marketing Application  Media Selection  Financial Application  Portfolio Selection  Financial Planning  Product Management Application  Product.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Class 10: Introduction to Linear Programming
Linear Programming Models: Graphical and Computer Methods
Slides Prepared by JOHN LOUCKS
Operations Management Linear Programming Module B
Chapter 3 Linear Programming Applications
John Loucks Modifications by A. Asef-Vaziri Slides by St. Edward’s
Slides by John Loucks St. Edward’s University.
Slides by John Loucks St. Edward’s University.
Modeling and Solving LP Problems in a Spreadsheet
Presentation transcript:

Linear Programming :Applications Pertemuan 6 Matakuliah: K0442-Metode Kuantitatif Tahun: 2009

Material Outline Blending Problem Portfolio Planning Problem Data Envelopment Analysis Revenue Management

Blending Problem Ferdinand Feed Company receives four raw grains from which it blends its dry pet food. The pet food advertises that each 8-ounce packet meets the minimum daily requirements for vitamin C, protein and iron. The cost of each raw grain as well as the vitamin C, protein, and iron units per pound of each grain are summarized on the next slide.

Blending Problem Vitamin C Protein Iron Grain Units/lb Units/lb Units/lb Cost/lb Ferdinand is interested in producing the 8-ounce mixture at minimum cost while meeting the minimum daily requirements of 6 units of vitamin C, 5 units of protein, and 5 units of iron.

Blending Problem Define the decision variables x j = the pounds of grain j (j = 1,2,3,4) used in the 8-ounce mixture Define the objective function Minimize the total cost for an 8-ounce mixture: MIN.75x x x x 4

Blending Problem Define the constraints Total weight of the mix is 8-ounces (.5 pounds): (1) x 1 + x 2 + x 3 + x 4 =.5 Total amount of Vitamin C in the mix is at least 6 units: (2) 9x x 2 + 8x x 4 > 6 Total amount of protein in the mix is at least 5 units: (3) 12x x x 3 + 8x 4 > 5 Total amount of iron in the mix is at least 5 units: (4) 14x x 3 + 7x 4 > 5 Nonnegativity of variables: x j > 0 for all j

The Management Scientist Output OBJECTIVE FUNCTION VALUE = VARIABLE VALUE REDUCED COSTS X X X X Thus, the optimal blend is about.10 lb. of grain 1,.21 lb. of grain 2,.09 lb. of grain 3, and.10 lb. of grain 4. The mixture costs Frederick’s 40.6 cents. Blending Problem

Portfolio Planning Problem Winslow Savings has $20 million available for investment. It wishes to invest over the next four months in such a way that it will maximize the total interest earned over the four month period as well as have at least $10 million available at the start of the fifth month for a high rise building venture in which it will be participating.

Portfolio Planning Problem For the time being, Winslow wishes to invest only in 2-month government bonds (earning 2% over the 2-month period) and 3-month construction loans (earning 6% over the 3-month period). Each of these is available each month for investment. Funds not invested in these two investments are liquid and earn 3/4 of 1% per month when invested locally.

Portfolio Planning Problem Formulate a linear program that will help Winslow Savings determine how to invest over the next four months if at no time does it wish to have more than $8 million in either government bonds or construction loans.

Portfolio Planning Problem Define the decision variables g j = amount of new investment in government bonds in month j c j = amount of new investment in construction loans in month j l j = amount invested locally in month j, where j = 1,2,3,4

Portfolio Planning Problem Define the objective function Maximize total interest earned over the 4-month period. MAX (interest rate on investment)(amount invested) MAX.02g g g g c c c c l l l l 4

Portfolio Planning Problem Define the constraints Month 1's total investment limited to $20 million: (1) g 1 + c 1 + l 1 = 20,000,000 Month 2's total investment limited to principle and interest invested locally in Month 1: (2) g 2 + c 2 + l 2 = l 1 or g 2 + c l 1 + l 2 = 0

Portfolio Planning Problem Define the constraints (continued) Month 3's total investment amount limited to principle and interest invested in government bonds in Month 1 and locally invested in Month 2: (3) g 3 + c 3 + l 3 = 1.02g l 2 or g 1 + g 3 + c l 2 + l 3 = 0

Portfolio Planning Problem Define the constraints (continued) Month 4's total investment limited to principle and interest invested in construction loans in Month 1, goverment bonds in Month 2, and locally invested in Month 3: (4) g 4 + c 4 + l 4 = 1.06c g l 3 or g 2 + g c 1 + c l 3 + l 4 = 0 $10 million must be available at start of Month 5: (5) 1.06c g l 4 > 10,000,000

Portfolio Planning Problem Define the constraints (continued) No more than $8 million in government bonds at any time: (6) g 1 < 8,000,000 (7) g 1 + g 2 < 8,000,000 (8) g 2 + g 3 < 8,000,000 (9) g 3 + g 4 < 8,000,000

Portfolio Planning Problem Define the constraints (continued) No more than $8 million in construction loans at any time: (10) c 1 < 8,000,000 (11) c 1 + c 2 < 8,000,000 (12) c 1 + c 2 + c 3 < 8,000,000 (13) c 2 + c 3 + c 4 < 8,000,000 Nonnegativity: g j, c j, l j > 0 for j = 1,2,3,4

Data Envelopment Analysis Data envelopment analysis (DEA) is an LP application used to determine the relative operating efficiency of units with the same goals and objectives. DEA creates a fictitious composite unit made up of an optimal weighted average (W 1, W 2,…) of existing units. An individual unit, k, can be compared by determining E, the fraction of unit k’s input resources required by the optimal composite unit. If E < 1, unit k is less efficient than the composite unit and be deemed relatively inefficient. If E = 1, there is no evidence that unit k is inefficient, but one cannot conclude that k is absolutely efficient.

Data Envelopment Analysis The DEA Model MIN E s.t.Weighted outputs > Unit k’s output (for each measured output) Weighted inputs < E [Unit k’s input] (for each measured input) Sum of weights = 1 E, weights > 0

The Langley County School District is trying to determine the relative efficiency of its three high schools. In particular, it wants to evaluate Roosevelt High. The district is evaluating performances on SAT scores, the number of seniors finishing high school, and the number of students who enter college as a function of the number of teachers teaching senior classes, the prorated budget for senior instruction, and the number of students in the senior class. Data Envelopment Analysis

Input Roosevelt Lincoln Washington Senior Faculty Budget ($100,000's) Senior Enrollments Data Envelopment Analysis

Output Roosevelt Lincoln Washington Average SAT Score High School Graduates College Admissions Data Envelopment Analysis

Decision Variables E = Fraction of Roosevelt's input resources required by the composite high school w 1 = Weight applied to Roosevelt's input/output resources by the composite high school w 2 = Weight applied to Lincoln’s input/output resources by the composite high school w 3 = Weight applied to Washington's input/output resources by the composite high school Data Envelopment Analysis

Objective Function Minimize the fraction of Roosevelt High School's input resources required by the composite high school: MIN E Data Envelopment Analysis

Constraints Sum of the Weights is 1: (1) w 1 + w 2 + w 3 = 1 Output Constraints: Since w 1 = 1 is possible, each output of the composite school must be at least as great as that of Roosevelt: (2) 800w w w 3 > 800 (SAT Scores) (3) 450w w w 3 > 450 (Graduates) (4) 140w w w 3 > 140 (College Admissions) Data Envelopment Analysis

Constraints Input Constraints: The input resources available to the composite school is a fractional multiple, E, of the resources available to Roosevelt. Since the composite high school cannot use more input than that available to it, the input constraints are: (5) 37w w w 3 < 37E (Faculty) (6) 6.4w w w 3 < 6.4E (Budget) (7) 850w w w 3 < 850E (Seniors) Nonnegativity of variables: E, w 1, w 2, w 3 > 0 Data Envelopment Analysis

The Management Scientist Output OBJECTIVE FUNCTION VALUE = VARIABLE VALUE REDUCED COSTS E W W W Data Envelopment Analysis

The Management Scientist Output CONSTRAINT SLACK/SURPLUS DUAL PRICES Data Envelopment Analysis

Conclusion The output shows that the composite school is made up of equal weights of Lincoln and Washington. Roosevelt is 76.5% efficient compared to this composite school when measured by college admissions (because of the 0 slack on this constraint (#4)). It is less than 76.5% efficient when using measures of SAT scores and high school graduates (there is positive slack in constraints 2 and 3.) Data Envelopment Analysis

Revenue Management n Another LP application is revenue management. n Revenue management involves managing the short- term demand for a fixed perishable inventory in order to maximize revenue potential. n The methodology was first used to determine how many airline seats to sell at an early-reservation discount fare and many to sell at a full fare.. n Application areas now include hotels, apartment rentals, car rentals, cruise lines, and golf courses.