B-1 Operations Management Linear Programming Module B - New Formulations.

Slides:



Advertisements
Similar presentations
WEEK-2 LINEAR PROGRAMMING Waheed Ullah PhD Scholar INU.
Advertisements

Chapter 3: Linear Programming Modeling Applications © 2007 Pearson Education.
Introduction to Mathematical Programming
EMGT 501 HW #1 Solutions Chapter 2 - SELF TEST 18
Linear Programming We are to learn two topics today: LP formulation
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved DSCI 3870 Chapter 5 ADVANCED LP APPLICATIONS Additional Reading Material.
___________________________________________________________________________ Operations Research  Jan Fábry Applications Linear Programming.
Linear Programming Problem Formulation.
Operations Management Linear Programming Module B - Part 2
Marketing Applications: Media selection
Math ES LC2 project Osama Zaid Abdullah
Goal Programming How do you find optimal solutions to the following?
Kerimcan OzcanMNGT 379 Operations Research1 Integer Linear Programming Chapter 8.
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
Introduction to Management Science
LP Extra Issues and Examples. Special Cases in LP Infeasibility Unbounded Solutions Redundancy Degeneracy More Than One Optimal Solution 2.
Example 3 Financial Model Rate of Return Summation Variable/Constraint
Operations Management
Real Estate Investment Performance Introduction. Real Estate Investment Performance.
Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 8-1 Introduction to Nonlinear Programming (NLP)
Linear and Integer Programming Models
1 MF-852 Financial Econometrics Lecture 2 Matrix Operations in Econometrics, Optimization with Excel Roy J. Epstein Fall 2003.
EMGT 501 HW #1 Due Day: Sep 13 Chapter 2 - SELF TEST 18
Linear Goal Programming
B-1 Operations Management Linear Programming Module B - Harder Formulations.
B-1 Operations Management Linear Programming Module B.
INTRODUCTION TO LINEAR PROGRAMMING
COB 291 An Introduction to Management Science Dr. Mike Busing College of Business, James Madison University.
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
STRATEGIC MANAGEMENT ACCOUNTING Anushka De Silva.
1 1 Slide Integer Linear Programming Professor Ahmadi.
Linear Programming Objective: I can solve problems using linear programming.
1 1 Slide Integer Linear Programming Professor Ahmadi.
 Charles’ Evaluation 2 3 Portfolio goals – Expected annual return of at least 7.5%. – At least 50% invested in “A-Rated” investments. – At least 40%
___________________________________________________________________________ Operations Research  Jan Fábry Linear Programming.
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.
___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry Linear Programming.
BUSINESS MATHEMATICS & STATISTICS. LECTURE 45 Planning Production Levels: Linear Programming.
Managerial Decision Modeling with Spreadsheets
Utdallas.edu /~ metin Page 1 Formulation Problems Outline u Whitt Window Company u Hotdogs and Buns u Portfolio Optimization u No debt u With debt u Production.
LINEAR PROGRAMMING APPLICATIONS IN MARKETING, FINANCE, AND OPERATIONS MANAGEMENT (2/3) Chapter 4 MANGT 521 (B): Quantitative Management.
“Real Estate Principles for the New Economy”: Norman G. Miller and David M. Geltner Real Estate QUIZMASTER DefinitionsAnalyticalAcronyms.
Goal Programming Linear program has multiple objectives, often conflicting in nature Target values or goals can be set for each objective identified Not.
1 Linear Programming (LP) 線性規劃 - George Dantzig, 1947.
10/9 More optimization Test 2 is scheduled for next Monday, October pm Come to this room, FB 200, to take the test. This is a room change from what.
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.
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
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.
1 A Logistics Problem The Dispatch Manager for ABC Logistics needs to send a fleet of 8 small trucks and 4 large trucks from a depot to pick up items at.
CDAE Class 12 Oct. 4 Last class: 2. Review of economic and business concepts Today: 3. Linear programming and applications Quiz 3 (sections 2.5 and.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Adeyl Khan, Faculty, BBA, NSU 1 Introduction to Linear Programming  A Linear Programming model seeks to maximize or minimize a linear function, subject.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Linear Programming Models: Graphical and Computer Methods
Ardavan Asef-Vaziri Systems and Operations Management
LINEARPROGRAMMING 5/23/ :13 AM 5/23/ :13 AM 1.
Stat 261 Two phase method.
Problem 1 Demand Total There are 20 full time employees, each can produce 10.
Introduction to Linear Programs
Linear Programming Dr. T. T. Kachwala.
Presentation by Team 2.
Integer Programming II
A Logistics Problem The Dispatch Manager for ABC Logistics needs to send a fleet of 7 small trucks and 4 large trucks from a depot to pick up items at.
LP Modeling Most common type of LP involves allocating resources to activities Determining this allocation involves choosing the levels of the activities.
Max Z = x1 + x2 2 x1 + 3 x2  6 (1) x2  1.5 (2) x1 - x2  2 (3)
Optimization Theory Linear Programming
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Module B Linear Programming.
Linear Optimization using Excel
Presentation transcript:

B-1 Operations Management Linear Programming Module B - New Formulations

B-2 You are creating an investment portfolio from 4 investment options: stocks, real estate, T-bills (Treasury-bills), and cash. Stocks have an annual rate of return of 12% and a risk measure of 5. Real estate has an annual rate of return of 10% and a risk measure of 8. T-bills have an annual rate of return of 5% and a risk measure of 1. Cash has an annual rate of return of 0% and a risk measure of 0. The average risk of the portfolio can not exceed 5. At least 15% of the portfolio must be in cash. Formulate an LP to maximize the annual rate of return of the portfolio. New Formulation #1

B-3 New Formulation #1 Constraints:: Average risk  5 At least 15% in cash Investment ReturnRisk Stocks Portfolio Real estate T-bills  5 Cash 0 0

B-4 New Formulation #1 Investment ReturnRisk Stocks Portfolio Real estate T-bills  5 Cash 0 0 Variables:: x i = % of portfolio in investment type i. i = 1 is Stocks; i = 2 is Real estate; i = 3 is T-bills; i=4 is is Cash

B-5 New Formulation #1 : Maximize: 0.12x x x 3 x i = % of portfolio in investment type i. i = 1 is Stocks; i = 2 is Real estate; i = 3 is T-bills; i=4 is is Cash x 4  0.15 (Cash) 5x 1 + 8x 2 + x 3  5 (Risk) x 1 + x 2 + x 3 + x 4 = 1.0 (Total = 100%) x 1, x 2, x 3, x 4  0 Optimal Solution is x 1 = 0.85, x 2 = 0, x 3 = 0 and x 4 = 0.15

B-6 New Formulation #1 x i = % of portfolio in investment type i. Maximize: 0.12x x x 3 x 4  0.15 (Cash) 5x 1 + 8x 2 + x 3  5 (Risk) x 1, x 2, x 3, x 4  0 Without the total = 100% constraint, the optimal solution is: x 1 = 0, x 2 = 0, x 3 = 5 and x 4 = 0.15 This means invest 500% in T-bills and get a 25% return!!

B-7 A business operates 24 hours a day and employees work 8 hour shifts. Shifts may begin at midnight, 4 am, 8 am, noon, 4 pm or 8 pm. The number of employees needed in each 4 hour period of the day to serve demand is in the table below. Formulate an LP to minimize the number of employees to satisfy the demand. New Formulation #2 Midnight - 4 am 4 am - 8 am am - noon 6 Noon - 4 pm 13 4 pm - 8 pm 15 8 pm - midnight 12

B-8 Heuristic Solution Start 9 at midnight, then need 0 to start at 4 am, then need 6 to start at 8 am, then need 7 to start at noon, then need 8 to start at 4 pm, and 4 to start at 8 pm. But those 4 also work from midnight to 4 am! Total = 34 Midnight - 4 am 4 am - 8 am am - noon 6 Noon - 4 pm 13 4 pm - 8 pm 15 8 pm - midnight 12

B-9 New Formulation # am8-noon12-4 pm4-8 pm8 pm am x1x1 x2x2 x3x3 x4x4 x5x5 x6x6 x6x6 x i = number of employees who start an 8 hour shift at time i i = 1 is midnight, i = 2 is 4 am, i = 3 is 8 am; i=4 is noon, i = 5 is 4 pm, i = 6 is 8 pm

B-10 New Formulation #2 Minimize: x 1 + x 2 + x 3 + x 4 + x 5 + x 6 x 1 + x 6  9 x 1, x 2, x 3, x 4, x 5, x 6  0 x i = Number of employees who start an 8 hour shift at time i. i = 1 is midnight, i = 2 is 4 am, i = 3 is 8 am; i=4 is noon, i = 5 is 4 pm, i = 6 is 8 pm x 1 + x 2  3 x 2 + x 3  6 x 3 + x 4  13 x 4 + x 5  15 x 5 + x 6  12

B-11 New Formulation #2 Minimize: x 1 + x 2 + x 3 + x 4 + x 5 + x 6 x 1 + x 6  9 x 1, x 2, x 3, x 4, x 5, x 6  0 x i = Number of employees who start an 8 hour shift at time i. x 1 + x 2  3 x 2 + x 3  6 x 3 + x 4  13 x 4 + x 5  15 x 5 + x 6  12 Optimal solution = 30 employees x 1 = 0, x 2 = 3, x 3 = 3, x 4 = 10, x 5 = 5, x 6 = 9 x 1 = 3, x 2 = 0, x 3 = 6, x 4 = 7, x 5 = 8, x 6 = 6