Examples discussed in class

Slides:



Advertisements
Similar presentations
LP—Graphical Solution Method MSci331—Week Convex Set and Extreme Points 2.
Advertisements

WEEK-2 LINEAR PROGRAMMING Waheed Ullah PhD Scholar INU.
Optimization problems using excel solver
BU Decision Models Integer_LP1 Integer Optimization Summer 2013.
Strategic Decisions (Part II)
Lesson 08 Linear Programming
Planning with Linear Programming
Linear Programming Problem
Linear Programming Models & Case Studies
Session II – Introduction to Linear Programming
Financial and Managerial Accounting Wild, Shaw, and Chiappetta Fifth Edition Wild, Shaw, and Chiappetta Fifth Edition McGraw-Hill/Irwin Copyright © 2013.
Optimization Models Module 9. MODEL OUTPUT EXTERNAL INPUTS DECISION INPUTS Optimization models answer the question, “What decision values give the best.
Linear Programming Problem Formulation.
Operations Management Linear Programming Module B - Part 2
Marketing Applications: Media selection
Chapter 8 Aggregate Planning in a Supply Chain
Managerial Decision Modeling with Spreadsheets
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Linear Programming: Formulations & Graphical Solution.
© 2008 Prentice-Hall, Inc. Chapter 7 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 7-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 7 Linear.
1 Optimization – Part II More Applications of Optimization to Operations Management In this session, we continue our discussion of “Optimization” and its.
Operations Management
EMGT 501 HW # Due Day: Sep 14.
Multi-Period Workforce Scheduling Basketball Team Problem SE 303 Lab.
INTRODUCTION TO LINEAR PROGRAMMING
Operations Management - 5 th Edition Chapter 13 Supplement Roberta Russell & Bernard W. Taylor, III Linear Programming.
Chapter 10. Resource Allocation
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
Relevant Costs and Benefits
Product Mix Problem Monet company makes four types of frames.
Linear Programming Chapter 13 Supplement.
Ardavan Asef-Vaziri Systems and Operations Management
Decision Making via Linear Programming: A simple introduction Fred Phillips
Part Three: Information for decision-making
Optimization Models Mathematical optimization models usually contain an objective (what to do) constraints (the rules that must be followed). Also referred.
Chapter 26 Part 1.
Chapter 12. Cost Concepts for Decision Making A relevant cost is a cost that differs between alternatives. 1 2.
Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 12 Financial and Cost- Volume-Profit Models.
Integer Programming Integer programming is a solution method for many discrete optimization problems Programming = Planning in this context Origins go.
Operations Management
©2014 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publically accessible website, in whole or in part.
Managerial Decision Modeling with Spreadsheets
Chapter 25 Short-Term Business Decisions
3 Characteristics of an Optimization Problem General descriptionKPiller Illustration Decisions that must be made; represented by decision variables How.
Chapter 1 Introduction n Introduction: Problem Solving and Decision Making n Quantitative Analysis and Decision Making n Quantitative Analysis n Model.
HW # Due:
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.
Integer Programming Definition of Integer Programming If requiring integer values is the only way in which a problem deviates from.
OPSM 301 Operations Management Class 13&14: Linear Programming using Excel Koç University Zeynep Aksin
LINEAR PROGRAMMING.
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.
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.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 7-1 1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 7 Linear.
1 Linear Programming Design of mathematical model.
Introduction Operations Research (OR) It is a scientific approach to determine the optimum (best) solution to a decision problem under the restriction.
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
Class 10: Introduction to Linear Programming
Linear Programming.
Engineering Economics (2+0)
Relevant Costs for Decision Making
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Exam 1 Review/Instructions
Chapter 8 Aggregate Planning in the Supply Chain
Chapter 8 Aggregate Planning in the Supply Chain
Widgets Problem Suppose a company produces two types of widgets, manual and electric. Each requires in its manufacture the use of three machines; A, B,
Presentation transcript:

Examples discussed in class LP Modeling Examples discussed in class

Example: Basketball Team Selection Coach Jack is trying to choose the starting line-up for the basketball team. The team consists of seven players who have been rated (on a scale of 1=poor to 3=excellent) according to their ball-handling, shooting, rebounding, and defensive abilities. The positions that each player is allowed to play and the player’s abilities are listed in the following table: The five-player starting line-up must satisfy the following restrictions: At least 4 members must be able to play guard, at least 2 members must be able to play forward, and at least 1 member must be able to play centre. The average ball-handling, shooting, and rebounding level of the starting line-up must be at least 2. If player 3 starts, then player 6 cannot start. If player 1 starts, then player 4 and 5 must both start. Either player 2 or player 3, or both, must start. Given these constraints, Coach Jack wants to maximize the total defensive ability of the starting team. Formulate an IP that will help him choose his starting team.

Categorization of OR

The General Structure of a Mathematical Model Inputs Uncontrollable factors (parameters) Output Independent (decision) variables Mathematical relationships Dependent variables

A Simplified Model of a Manufacturing Situation Uncontrollable variables: 5, 2, and 50 (market prices, marketing limitation) Decision variables: x1, x2 (What quantities of products 1 and 2 should be produced?) Dependent variable: R = 5x1 + 2x2 (total revenue) Mathematical relationship: Maximize revenue Objective Constraint Subject to: x1 + x2  50

Example 1: LP Formulation Papa Louis manufacturers wooden tables and chairs for small kids. Each "table" built: Sells for $27 and uses $10 worth of raw materials, increases Papa Louis’s variable labor/overhead costs by $14. Requires 2 hours of finishing labor and 1 hour of carpentry labor. Each "chair" built: Sells for $21 and uses $9 worth of raw materials, increase Papa Louis’s variable labor/overhead costs by $10. Requires 1 hours of finishing labor AND 1 hour of carpentry labor. Each week Papa Louis can obtain only 100 finishing hours and only 80 carpentry hours. Also demand for the chairs is unlimited. However, at most 40 tables are bought each week. Papa Louis wants to maximize weekly profit (revenues - expenses).

Example 2: LP Formulation Production Planning: A manufacturing firm has discontinued production of a certain unprofitable product line. This created considerable excess production capacity. Management is considering devoting this excess capacity to one or more of the three products: call them products 1, 2, and 3. The available capacity on the machines that might limit output is summarized in the following table: The number of machine hours required for each unit of the respective products is given as: The sales department indicates that the sales potential for products 1, and 2 exceeds the maximum production rate and that the sales potential for product 3 is 20 units per week. The unit profit would be $ 30.0, $20, and $ 15, respectively, on products 1, 2, and 3. Formulate the linear programming model for determining how much of each product to produce in order to maximize profits. Total Availability of resources <500 hr/week <350 hr/week <150 hr/week

Example 3: Crude Petroleum Shell Petroleum runs a small refinery on the Texas coast. The refinery distills crude petroleum from two sources, Saudi Arabia and Venezuela, into three main products: gasoline, jet fuel, and lubricants. The two crudes differ in chemical composition and thus yield different product mixes. Each barrel of Saudi crude yields 0.3 barrel of gasoline, 0.4 barrel of jet fuel, and 0.2 barrel of lubricants. On the other hand, each barrel of Venezuelan crude yields 0.4 barrel of gasoline but only 0.2 barrel of jet fuel and 0.3 barrel of lubricants. The remaining 10 of each barrel is lost to refining. The crudes also differ in cost and availability, Shell can purchase up to 9000 barrels per day from Saudi Arabia at $20 per barrel. Up to 6000 barrels per day of Venezuelan petroleum are also available at the lower cost of $15 per barrel because of the shorter transportation distance. Shell's contracts with independent distributors require it to produce 2000 barrels per day of gasoline, 1500 barrels per day of jet fuel, and 500 barrels per day of lubricants. How can these requirements be fulfilled most efficiently?

Example 4: LP Formulation Manpower Planning: Certain types of facilities operate seven days each week and face the problem of allocating manpower during the week as staffing requirements change as a function of the day of the week. Perhaps the most fundamental staffing problem is the assignment of days off to full-time employees. In particular, it is regularly the case that each employee is entitled to two consecutive days off per week. If the number of employees required on each of the seven days of the week is given, then the problem is to find the minimum workforce size which allows these demands to be met and then to determine the days off for the people in this work-force. To be specific, let us study the problem faced by Grand River Transit Bus Company. The number of drivers required for each day of the week is as follows: How many drivers should be scheduled to start a five-days stint on each day of the week? Formulate this problem as a linear program. If daily pay is $50 per person on weekdays, $75 on Saturday, $90 on Sundays. Modify the LP formulation so that the objective is now to minimize the weekly payroll costs rather than to minimize the workforce size.

Example 5: LP Formulation Target Shirt Company makes three varieties of shirts: Collegiate, Traditional and European. These shirts are made from different combinations of cotton and polyester. The cost per yard of unblended cotton is $5 and for unblended polyester is $4. Target can receive up to 4,000 yards of raw cotton and 3,000 yards of raw polyester fabric weekly. The table shows below pertinent data concerning the manufacture of the shirts. (Meet weekly contracts or more; while not exceeding weekly demand).   Formulate and solve a linear program that would give a manufacturing policy for Target Shirt Company.

Example 5: LP Formulation Finco has the following investments available: Investment A For each dollar invested at time 0, we receive $ 0.10 at time 1 and $1.30 at time 2. Time 0= now; time 1 = one year from now; and so on.) Investment B For each dollar invested at time 1, we receive $1.60 at time 2. Investment C For each dollar invested at time 2, we receive $1.20 at time 3.   At any time, leftover cash may be invested in T-bills, which pay 10% per year. At time 0, we have $100. At most, $50 can be invested in each of investments A, B, and C. Formulate an LP that can be used to maximize Finco’s cash on hand at time 3.