1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.

Slides:



Advertisements
Similar presentations
Chapter 3: Linear Programming Modeling Applications © 2007 Pearson Education.
Advertisements

Managerial Decision Modeling with Spreadsheets
Introduction to Mathematical Programming
Linear Programming We are to learn two topics today: LP formulation
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.
OPSM 301 Operations Management
Planning with Linear Programming
Linear Programming Problem
Linear Programming Problem Formulation.
Marketing Applications: Media selection
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
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
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Three Classic Applications of LP Product Mix at Ponderosa Industrial –Considered limited.
Linear Programming (6S) and Transportation Problem (8S)
1 Lecture 2 MGMT 650 Linear Programming Applications Chapter 4.
INTRODUCTION TO LINEAR PROGRAMMING
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
© Thomson/South-WesternSlideCHAPTER 241 BUDGETING, SAVING, AND INVESTING MONEY 24.1Budgeting Money 24.2Saving Money 24.3Investing Money Chapter 24.
Copyright 2007 Thomson South-Western Chapter 4 Financial Decisions and Planning.
 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.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
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.
1 1 Slide Chapter 4 Linear Programming Applications nBlending Problem nPortfolio Planning Problem nProduct Mix Problem.
Linear Programming :Applications Pertemuan 6 Matakuliah: K0442-Metode Kuantitatif Tahun: 2009.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming: Applications Chapter 4.
Chapter 3: Linear Programming Modeling Applications
Accounting Principles, Ninth Edition
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 © 2005 Thomson/South-Western Chapter 4 Linear Programming Applications n Portfolio Planning Problem n Product Mix Problem n Blending Problem.
Production Management Application by Aparna Asha. v Saritha Jinto Antony Kurian.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
OPSM 301 Operations Management
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.
1 Linear Programming Chapter 2 By Mohammad Shahid Khan M.Eco, MBA, B.Cs, B.Ed. Lecturer in Economics & Business Administration Department of Economics.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Managerial Decision Modeling with Spreadsheets
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
LINEAR PROGRAMMING APPLICATIONS IN MARKETING, FINANCE, AND OPERATIONS MANAGEMENT (2/3) Chapter 4 MANGT 521 (B): Quantitative Management.
MANGT 521 (B): Quantitative Management
MANGT 521 (B): Quantitative Management
Question Relax and Enjoy Lake Development Corporation is developing a lakeside community at a privately owned lake.Their primary market includes all the.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
4-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Modeling Examples Chapter 4.
BA250 MANAGEMENT SCIENCE EXAMPLE PROBLEMS
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
OPSM 301 Operations Management Class 11: Linear Programming using Excel Koç University Zeynep Aksin
Chapter 4 Linear Programming Applications. 2 POP QUIZ #4 [5 points]
Chapter 3 Linear Programming Applications
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 Linear Programming Design of mathematical model.
1 Introduction To Linear Programming l Today many of the resources needed as inputs to operations are in limited supply. l Operations managers must understand.
Chapter 3 Introduction to Linear Programming to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c)
Linear Programming Applications
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.
Class 10: Introduction to Linear Programming
Linear Programming Models: Graphical and Computer Methods
Linear Programming Dr. T. T. Kachwala.
Chapter 3 Linear Programming Applications
BA250 MANAGEMENT SCIENCE EXAMPLE PROBLEMS
John Loucks Modifications by A. Asef-Vaziri Slides by St. Edward’s
Slides by John Loucks St. Edward’s University.
Presentation transcript:

1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University

2 2 Slide © 2008 Thomson South-Western. All Rights Reserved Chapter 4 Linear Programming Applications in Marketing, Finance and Operations PART 1: n Marketing Applications: Media Selection n Financial Applications: Portfolio Selection n Operations Management Applications: Production Scheduling

3 3 Slide © 2008 Thomson South-Western. All Rights Reserved n One application of linear programming in marketing is media selection. n LP can be used to help marketing managers allocate a fixed budget to various advertising media. n The objective is to maximize reach, frequency, and quality of exposure. n Restrictions on the allowable allocation usually arise during consideration of company policy, contract requirements, and media availability. Marketing Applications

4 4 Slide © 2008 Thomson South-Western. All Rights Reserved Media Selection SMM Company recently developed a new instant SMM Company recently developed a new instant salad machine, has $282,000 to spend on advertising. The product is to be initially test marketed in the Dallas area. The money is to be spent on a TV advertising blitz during one weekend (Friday, Saturday, and Sunday) in November. The three options available The three options available are: daytime advertising, evening news advertising, and Sunday game-time advertising. A mixture of one- minute TV spots is desired.

5 5 Slide © 2008 Thomson South-Western. All Rights Reserved Media Selection Estimated Audience Estimated Audience Ad Type Reached With Each Ad Cost Per Ad Daytime 3,000 $5,000 Evening News 4,000 $7,000 Sunday Game 75,000 $100,000 SMM wants to take out at least one ad of each type (daytime, evening-news, and game-time). Further, there are only two game-time ad spots available. There are ten daytime spots and six evening news spots available daily. SMM wants to have at least 5 ads per day, but spend no more than $50,000 on Friday and no more than $75,000 on Saturday. SMM wants to take out at least one ad of each type (daytime, evening-news, and game-time). Further, there are only two game-time ad spots available. There are ten daytime spots and six evening news spots available daily. SMM wants to have at least 5 ads per day, but spend no more than $50,000 on Friday and no more than $75,000 on Saturday.

6 6 Slide © 2008 Thomson South-Western. All Rights Reserved Media Selection DFR = number of daytime ads on Friday DSA = number of daytime ads on Saturday DSU = number of daytime ads on Sunday EFR = number of evening ads on Friday ESA = number of evening ads on Saturday ESU = number of evening ads on Sunday GSU = number of game-time ads on Sunday n Define the Decision Variables

7 7 Slide © 2008 Thomson South-Western. All Rights Reserved Media Selection n Define the Objective Function Maximize the total audience reached: Max (audience reached per ad of each type) x (number of ads used of each type) x (number of ads used of each type) Max 3000 DFR DSA DSU EFR ESA ESU GSU ESA ESU GSU

8 8 Slide © 2008 Thomson South-Western. All Rights Reserved Media Selection n Define the Constraints Take out at least one ad of each type: (1) DFR + DSA + DSU > 1 (1) DFR + DSA + DSU > 1 (2) EFR + ESA + ESU > 1 (2) EFR + ESA + ESU > 1 (3) GSU > 1 (3) GSU > 1 Ten daytime spots available: (4) DFR < 10 (4) DFR < 10 (5) DSA < 10 (5) DSA < 10 (6) DSU < 10 (6) DSU < 10 Six evening news spots available: (7) EFR < 6 (7) EFR < 6 (8) ESA < 6 (8) ESA < 6 (9) ESU < 6 (9) ESU < 6

9 9 Slide © 2008 Thomson South-Western. All Rights Reserved Media Selection n Define the Constraints (continued) Only two Sunday game-time ad spots available: (10) GSU < 2 (10) GSU < 2 At least 5 ads per day: (11) DFR + EFR > 5 (11) DFR + EFR > 5 (12) DSA + ESA > 5 (12) DSA + ESA > 5 (13) DSU + ESU + GSU > 5 (13) DSU + ESU + GSU > 5 Spend no more than $50,000 on Friday: (14) 5000 DFR EFR < (14) 5000 DFR EFR < 50000

10 Slide © 2008 Thomson South-Western. All Rights Reserved Media Selection n Define the Constraints (continued) Spend no more than $75,000 on Saturday: (15) 5000 DSA ESA < (15) 5000 DSA ESA < Spend no more than $282,000 in total: (16) 5000 DFR DSA DSU EFR (16) 5000 DFR DSA DSU EFR ESA ESU GSU 7 < ESA ESU GSU 7 < Non-negativity: DFR, DSA, DSU, EFR, ESA, ESU, GSU > 0 DFR, DSA, DSU, EFR, ESA, ESU, GSU > 0

11 Slide © 2008 Thomson South-Western. All Rights Reserved Media Selection n The Management Scientist Solution Objective Function Value = Variable Value Reduced Costs Variable Value Reduced Costs DFR DFR DSA DSA DSU DSU EFR EFR ESA ESA ESU ESU GSU GSU

12 Slide © 2008 Thomson South-Western. All Rights Reserved Media Selection n Solution Summary Total new audience reached = 199,000 Number of daytime ads on Friday = 8 Number of daytime ads on Friday = 8 Number of daytime ads on Saturday = 5 Number of daytime ads on Saturday = 5 Number of daytime ads on Sunday = 2 Number of daytime ads on Sunday = 2 Number of evening ads on Friday = 0 Number of evening ads on Friday = 0 Number of evening ads on Saturday = 0 Number of evening ads on Saturday = 0 Number of evening ads on Sunday = 1 Number of evening ads on Sunday = 1 Number of game-time ads on Sunday= 2 Number of game-time ads on Sunday= 2

13 Slide © 2008 Thomson South-Western. All Rights Reserved Financial Applications n LP can be used in financial decision-making that involves capital budgeting, make-or-buy, asset allocation, portfolio selection, financial planning, and more. n Portfolio selection problems involve choosing specific investments – for example, stocks and bonds – from a variety of investment alternatives. n This type of problem is faced by managers of banks, mutual funds, and insurance companies. n The objective function usually is maximization of expected return or minimization of risk.

14 Slide © 2008 Thomson South-Western. All Rights Reserved Portfolio Selection 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.

15 Slide © 2008 Thomson South-Western. All Rights Reserved Portfolio Selection 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.

16 Slide © 2008 Thomson South-Western. All Rights Reserved Portfolio Selection 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.

17 Slide © 2008 Thomson South-Western. All Rights Reserved Portfolio Selection n Define the Decision Variables G i = amount of new investment in government G i = amount of new investment in government bonds in month i (for i = 1, 2, 3, 4) bonds in month i (for i = 1, 2, 3, 4) C i = amount of new investment in construction C i = amount of new investment in construction loans in month i (for i = 1, 2, 3, 4) loans in month i (for i = 1, 2, 3, 4) L i = amount invested locally in month i, L i = amount invested locally in month i, (for i = 1, 2, 3, 4) (for i = 1, 2, 3, 4)

18 Slide © 2008 Thomson South-Western. All Rights Reserved Portfolio Selection n Define the Objective Function Maximize total interest earned in the 4-month period: Maximize total interest earned in the 4-month period: Max (interest rate on investment) X (amount invested) Max (interest rate on investment) X (amount invested) Max.02G G G G 4 Max.02G G G G C C C C C C C C L L L L L L L L 4

19 Slide © 2008 Thomson South-Western. All Rights Reserved Portfolio Selection n Define the Constraints Month 1's total investment limited to $20 million: Month 1's total investment limited to $20 million: (1) G 1 + C 1 + L 1 = 20,000,000 (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: Month 2's total investment limited to principle and interest invested locally in Month 1: (2) G 2 + C 2 + L 2 = L 1 (2) G 2 + C 2 + L 2 = L 1 or G 2 + C L 1 + L 2 = 0 or G 2 + C L 1 + L 2 = 0

20 Slide © 2008 Thomson South-Western. All Rights Reserved Portfolio Selection n 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.02 G L 2 (3) G 3 + C 3 + L 3 = 1.02 G L 2 or G 1 + G 3 + C L 2 + L 3 = 0 or G 1 + G 3 + C L 2 + L 3 = 0

21 Slide © 2008 Thomson South-Western. All Rights Reserved Portfolio Selection n 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.06 C G L 3 (4) G 4 + C 4 + L 4 = 1.06 C G L 3 or G 2 + G C 1 + C L 3 + L 4 = 0 or G 2 + G C 1 + C L 3 + L 4 = 0 $10 million must be available at start of Month 5: (5) 1.06 C G L 4 > 10,000,000 (5) 1.06 C G L 4 > 10,000,000

22 Slide © 2008 Thomson South-Western. All Rights Reserved Portfolio Selection n Define the Constraints (continued) No more than $8 million in government bonds at any time: (6) G 1 < 8,000,000 (6) G 1 < 8,000,000 (7) G 1 + G 2 < 8,000,000 (7) G 1 + G 2 < 8,000,000 (8) G 2 + G 3 < 8,000,000 (8) G 2 + G 3 < 8,000,000 (9) G 3 + G 4 < 8,000,000 (9) G 3 + G 4 < 8,000,000

23 Slide © 2008 Thomson South-Western. All Rights Reserved Portfolio Selection n Define the Constraints (continued) No more than $8 million in construction loans at any time: (10) C 1 < 8,000,000 (10) C 1 < 8,000,000 (11) C 1 + C 2 < 8,000,000 (11) C 1 + C 2 < 8,000,000 (12) C 1 + C 2 + C 3 < 8,000,000 (12) C 1 + C 2 + C 3 < 8,000,000 (13) C 2 + C 3 + C 4 < 8,000,000 (13) C 2 + C 3 + C 4 < 8,000,000Non-negativity: G i, C i, L i > 0 for i = 1, 2, 3, 4 G i, C i, L i > 0 for i = 1, 2, 3, 4

24 Slide © 2008 Thomson South-Western. All Rights Reserved Portfolio Selection n The Management Scientist Solution Objective Function Value = Objective Function Value = Variable Value Reduced Costs Variable Value Reduced Costs G G G G G G G G C C C C C C C C L L L L L L L L

25 Slide © 2008 Thomson South-Western. All Rights Reserved Operations Management Applications n LP can be used in operations management to aid in decision-making about product mix, production scheduling, staffing, inventory control, capacity planning, and other issues. n An important application of LP is multi-period planning such as production scheduling. n Usually the objective is to establish an efficient, low- cost production schedule for one or more products over several time periods. n Typical constraints include limitations on production capacity, labor capacity, storage space, and more.

26 Slide © 2008 Thomson South-Western. All Rights Reserved Chip Hoose is the owner of Hoose Custom Wheels. Chip has just received orders for 1,000 standard wheels Chip Hoose is the owner of Hoose Custom Wheels. Chip has just received orders for 1,000 standard wheels and 1,250 deluxe wheels next month and for 800 standard and 1,500 deluxe the following month. All orders must be filled. Production Scheduling The cost of making standard wheels The cost of making standard wheels is $10 and deluxe wheels is $16. Over- time rates are 50% higher. There are 1,000 hours of regular time and 500 hours of overtime available each month. It takes.5 hour to make a standard wheel and.6 hour to make a deluxe wheel. The cost of storing a wheel from one month to the next is $2.

27 Slide © 2008 Thomson South-Western. All Rights Reserved Production Scheduling We want to determine the regular-time and overtime We want to determine the regular-time and overtime production quantities in each month for standard and production quantities in each month for standard and deluxe wheels. deluxe wheels. Month 1 Month 2 Month 1 Month 2 Wheel Reg. Time Overtime Reg. Time Overtime Standard SR 1 SO 1 SR 2 SO 2 Deluxe DR 1 DO 1 DR 2 DO 2 n Define the Decision Variables

28 Slide © 2008 Thomson South-Western. All Rights Reserved Production Scheduling We also want to determine the inventory quantities We also want to determine the inventory quantities for standard and deluxe wheels. for standard and deluxe wheels. SI = number of standard wheels held in SI = number of standard wheels held in inventory from month 1 to month 2 inventory from month 1 to month 2 DI = number of deluxe wheels held in DI = number of deluxe wheels held in inventory from month 1 to month 2 inventory from month 1 to month 2 n Define the Decision Variables

29 Slide © 2008 Thomson South-Western. All Rights Reserved Production Scheduling We want to minimize total production and inventory We want to minimize total production and inventory costs for standard and deluxe wheels. costs for standard and deluxe wheels. Min (production cost per wheel) Min (production cost per wheel) x (number of wheels produced) x (number of wheels produced) + (inventory cost per wheel) + (inventory cost per wheel) x (number of wheels in inventory) x (number of wheels in inventory) Min 10 SR SO SR SO 2 Min 10 SR SO SR SO DR DO DR DO DR DO DR DO SI + 2 DI + 2 SI + 2 DI n Define the Objective Function

30 Slide © 2008 Thomson South-Western. All Rights Reserved Production Scheduling Production Month 1 = (Units Required) + (Units Stored) Standard: (1) SR 1 + SO 1 = 1,000 + SI or SR 1 + SO 1  SI = 1,000 (1) SR 1 + SO 1 = 1,000 + SI or SR 1 + SO 1  SI = 1,000Deluxe: (2) DR 1 + DO 1 = 1,250 + DI or DR 1 + DO 1  – DI = 1,250 (2) DR 1 + DO 1 = 1,250 + DI or DR 1 + DO 1  – DI = 1,250 Production Month 2 = (Units Required)  (Units Stored) Standard: (3) SR 2 + SO 2 = 800  SI or SR 2 + SO 2 + SI = 800 (3) SR 2 + SO 2 = 800  SI or SR 2 + SO 2 + SI = 800Deluxe: (4) DR 2 + DO 2 = 1,500  DI or DR 2 + DO 2 + DI = 1,500 (4) DR 2 + DO 2 = 1,500  DI or DR 2 + DO 2 + DI = 1,500 n Define the Constraints

31 Slide © 2008 Thomson South-Western. All Rights Reserved Production Scheduling Reg. Hrs. Used Month 1 < Reg. Hrs. Avail. Month 1 (5).5 SR DR 1 < 1000 (5).5 SR DR 1 < 1000 OT Hrs. Used Month 1 < OT Hrs. Avail. Month 1 (6).5 SO DO 1 < 500 (6).5 SO DO 1 < 500 Reg. Hrs. Used Month 2 < Reg. Hrs. Avail. Month 2 (7).5 SR DR 2 < 1000 (7).5 SR DR 2 < 1000 OT Hrs. Used Month 2 < OT Hrs. Avail. Month 2 (8).5 SO DO 2 < 500 (8).5 SO DO 2 < 500 n Define the Constraints (continued)

32 Slide © 2008 Thomson South-Western. All Rights Reserved Objective Function Value = Variable Value Reduced Cost Variable Value Reduced Cost SR SO SR SO SO DR DR DO DO DR DR DO DO SI SI DI DI n The Management Scientist Solution Production Scheduling

33 Slide © 2008 Thomson South-Western. All Rights Reserved Thus, the recommended production schedule is: Month 1 Month 2 Month 1 Month 2 Reg. Time Overtime Reg. Time Overtime Reg. Time Overtime Reg. Time Overtime Standard Deluxe No wheels are stored and the minimum total cost is $67,500. n Solution summary Production Scheduling

34 Slide © 2008 Thomson South-Western. All Rights Reserved End of Chapter 4 – Part 1