Extra Credit Problem 5 Page 76 Gothams Finest Group 3 Saud Aldegaiter Daniel Bonneville Tamara Vail October 18, 2011 IE 416 Dr. Parisay.

Slides:



Advertisements
Similar presentations
3 hr 5 hr 8 hr Hours worked Charge
Advertisements

Solving Linear Programming Problems
1 Chapter 14 Making the most of things: Linear Programming.
5.3 Inverse Function.
LINEAR PROGRAMMING 1.224J/ESD.204J
February 21, 2002 Simplex Method Continued
Thursday, March 7 Duality 2 – The dual problem, in general – illustrating duality with 2-person 0-sum game theory Handouts: Lecture Notes.
February 7, 2002 A brief review of Linear Algebra Linear Programming Models Handouts: Lecture Notes.
February 14, 2002 Putting Linear Programs into standard form
Graph of a Curve Continuity This curve is _____________These curves are _____________ Smoothness This curve is _____________These curves are _____________.
Graph of a Curve Continuity This curve is continuous
Created by Mr.Lafferty Maths Dept
Calculating Slope m = y2 – y1 x2 – x1.
Maximal Independent Subsets of Linear Spaces. Whats a linear space? Given a set of points V a set of lines where a line is a k-set of points each pair.
INCOME AND SUBSTITUTION EFFECTS
Intro Management Science Fall 2011 Bruce Duggan Providence University College.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 17 Integer Programming.
Lecture 2 A Telephone Staffing Problem
Kronos Timecard Pay Rounding Tips.
IENG313 Operation Research I
1 Chapter 10 Multicriteria Decision-Marking Models.
DIVISIBILITY, FACTORS & MULTIPLES
Another example Max z=5x1+12x2+4x3-MR S.t. x1+2x2+x3+x4=10
An Application of Linear Programming Lesson 12 The Transportation Model.
§ 6.2 Areas and Riemann Sums. Area Under a Graph Riemann Sums to Approximate Areas (Midpoints) Riemann Sums to Approximate Areas (Left Endpoints) Applications.
SENSITIVITY ANALYSIS. luminous lamps produces three types of lamps A, B And C. These lamps are processed on three machines X, Y and Z. the full technology.
Ideal Parent Structure Learning School of Engineering & Computer Science The Hebrew University, Jerusalem, Israel Gal Elidan with Iftach Nachman and Nir.
1 K  Convexity and The Optimality of the (s, S) Policy.
Artificial Variables, 2-Phase and Big M Methods
Constant, Linear and Non-Linear Constant, Linear and Non-Linear
On / By / With The building blocks of the Mplus language.
Ch. 1: Number Relationships
Gradient of a straight line x y 88 66 44 2 44 4 For the graph of y = 2x  4 rise run  = 8  4 = 2 8 rise = 8 4 run = 4 Gradient = y.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Operations Management - 5 th Edition Chapter 13 Supplement Roberta.
23-8 3x6 Double it Take Away 6 Share By 9 Double it +10 Halve it Beginner Start Answer Intermediate 70 50% of this ÷7÷7 x8 Double it Start Answer.
Warm up Factor the expression. 10x – 5x2 ANSWER 5x (2 – x)
2 x0 0 12/13/2014 Know Your Facts!. 2 x1 2 12/13/2014 Know Your Facts!
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 12 Duality Theory.
2 x /18/2014 Know Your Facts!. 11 x /18/2014 Know Your Facts!
IEOR 4004 Midterm Review (part I)
5 x4. 10 x2 9 x3 10 x9 10 x4 10 x8 9 x2 9 x4.
MS 101: Algorithms Instructor Neelima Gupta
EMIS 8374 LP Review: The Ratio Test. 1 Main Steps of the Simplex Method 1.Put the problem in row-0 form. 2.Construct the simplex tableau. 3.Obtain an.
Linear Programming – Simplex Method: Computational Problems Breaking Ties in Selection of Non-Basic Variable – if tie for non-basic variable with largest.
Multiplication Facts Practice
Chapter 8: The Solver and Mathematical Programming Spreadsheet-Based Decision Support Systems Prof. Name Position (123) University.
Computational Facility Layout
Graeme Henchel Multiples Graeme Henchel
Quiz Number 2 Group 1 – North of Newark Thamer AbuDiak Reynald Benoit Jose Lopez Rosele Lynn Dave Neal Deyanira Pena Professor Kenneth D. Lawerence New.
(1) MAX X1+3X2+2X3+4X4 X1=AM PHONE, X2=AM RIDE, X3=AFT PHONE, X4=AFT RIDE CONSTRAINTS AM: X1+20X2 < 12(60)=720 AFT: 2X3+30X4 < 14(60) = 840 GAS: X2+X4.
0 x x2 0 0 x1 0 0 x3 0 1 x7 7 2 x0 0 9 x0 0.
Simplex (quick recap). Replace all the inequality constraints by equalities, using slack variables.
BINARY/MIXED-INTEGER PROGRAMMING ( A SPECIAL TYPE OF INTEGER PROGRAMMING)
7x7=.
Operation Research By Anitha Chandran Chitra.R Radha.R Sudhit Sethi.
What is sensitivity analysis? Why do we perform sensitivity analysis? How far do we like to perform sensitivity analysis? In an LP sensitivity analysis,
Operations Management Linear Programming Module B - Part 2
B-1 Operations Management Linear Programming Module B - New Formulations.
B-1 Operations Management Linear Programming Module B - Harder Formulations.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Example 15.3 Supplying Power at Midwest Electric Logistics Model.
Robert Delgado Chris Mui Amanda Smith Presented to: Dr. Sima Parisay Due: October 20 th, 2011 California State Polytechnic University, Pomona.
Presentation: H. Sarper
Chapter 7 Transportation, Assignment & Transshipment Problems
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Team 9 Jin woo Choi Philip Liu Nallely Tagle
Operations Research I IE 416 California State Polytechnic University, Pomona Operations Research I IE 416 California State Polytechnic University, Pomona.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Presentation by Team 2.
What is sensitivity analysis? Why do we perform sensitivity analysis?
Presentation transcript:

Extra Credit Problem 5 Page 76 Gothams Finest Group 3 Saud Aldegaiter Daniel Bonneville Tamara Vail October 18, 2011 IE 416 Dr. Parisay

Outline Problem Statement Summary of Problem Formulation of Problem WinQSB Inputs and Solution Solution Summary Objective Function Sensitivity Analysis RHS Sensitivity Analysis Report to Manager

Problem Statement Pg. 76 Problem 5 Each day, workers at the Gotham City Police Department work two 6-hour shift chosen from 12 a.m. to 6 a.m., 6 a.m. to 12 p.m., 12 p.m. to 6 p.m., and 6 p.m. to 12 a.m. The number of workers are needed during each shift are shown at table below. Workers whose two shifts are consecutive are paid $12 per hour; workers whose shifts are not consecutive are paid $18 per hour. Formulate an LP that can be used to minimize the cost of meeting the daily work-force demands of the Gotham City Police Department.

Summary Consecutive Shifts = $12 an hour Not Consecutive Shifts = $18 an hour Shift iTimeWorkers Needed 112 am to 6 am15 26 am to 12 pm5 312 pm to 6 pm12 46 pm to 12 am6

Formulation of Problem Decision Variables: X i = Number of workers whose two shifts are consecutive and start at shift I (Shift i=1,2,3,4) Y j = Number of workers whose two shifts are not consecutive and start at shift j (Shift j=1,2) X i ≥ 0 Y j ≥ 0

Formulation of Problem Objective Function: Minimize Z = 12(X 1 +X 2 +X 3 +X 4 ) + 18(Y 1 +Y 2 ) Shift 1Shift 2Shift 3Shift 4 X1X1 X1X1 X2X2 X2X2 X3X3 X3X3 X4X4 X4X4 Y1Y1 Y1Y1 Y2Y2 Y2Y Constraints: X 1 +X 4 +Y 1 =15 X 1 +X 2 +Y 2 =5 X 2 +X 3 +Y 1 =12 X 3 +X 4 +Y 2 =6

WinQSB Input Consecutive Shift 1 = X 1 Consecutive Shift 2 = X 2 Consecutive Shift 3 = X 3 Consecutive Shift 4 = X 4 Not Consecutive Shift 1 = Y 1 Not Consecutive Shift 2 = Y 2

WinQSB Solution

Solution Summary ShiftNumber of Workers Total Cost X1X1 5$60 X2X2 0$0 X3X3 4$48 X4X4 2$24 Y1Y1 8$144 Y2Y2 0$0 Z min =$276

Sensitivity Analysis of O.F. The only possible SA that can be done to the O.F. Is the not consecutive shift 2 because it is the only variable that has an RC value. Therefore we changed the hourly rate from $18 to $6 based on RC=12

Sensitivity Analysis of O.F.

Although the Z min decreases we realize that it is not practical for the hourly wage to decrease by $12.

Sensitivity Analysis of RHS We choose to decrease the number of workers on shift 3 for a couple reasons: ◦ It has one of the largest SP (SP=9) ◦ More flexibility in the allowable range which will minimize our cost.

Sensitivity Analysis of RHS

Report to Manager Minimum cost $276 Decrease hourly wage for non consecutive shift 2 from $18 to $6 Decrease number of workers in shift 3 from 12 to 11 which is within the range ShiftTime of ShiftNumber of Workers Total Cost Consecutive Shift 112am-12pm5$60 Consecutive Shift 26am-6pm0$0 Consecutive Shift 312pm-12am4$48 Consecutive Shift 4 4 6pm-6am2$24 Not Consecutive Shift 112am-6am & 12pm-6pm8$144 Not Consecutive Shift 26am-12pm & 6pm-12am0$0

QUESTIONS?