Team 9 Jin woo Choi Philip Liu Nallely Tagle

Slides:



Advertisements
Similar presentations
Linear Programming Problem
Advertisements

Linear Programming We are to learn two topics today: LP formulation
Linear Programming.
Lesson 11 Multicriteria Decisions within LP Framework.
Transportation, Transshipment and Assignment Models and Assignment Models.
1/53 Slide Linear Programming: Sensitivity Analysis and Interpretation of Solution n Introduction to Sensitivity Analysis n Graphical Sensitivity Analysis.
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
Operations Management Linear Programming Module B - Part 2
Goal Programming How do you find optimal solutions to the following?
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
Linear Programming Example 5 Transportation Problem.
LPX-1. Linear Programming Models in Services Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
Pet Food Company A pet food company wants to find the optimal mix of ingredients, which will minimize the cost of a batch of food, subject to constraints.
Linear Goal Programming
1 1 Slide Chapter 14: Goal Programming Goal programming is used to solve linear programs with multiple objectives, with each objective viewed as a "goal".
Heart Valves Suppliers
B-1 Operations Management Linear Programming Module B.
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.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Inventory Management for Independent Demand
Optimization I Operations -- Prof. Juran. Outline Basic Optimization: Linear programming –Graphical method –Spreadsheet Method Extension: Nonlinear programming.
1 1 Slides by John Loucks St. Edward’s University Modifications by A. Asef-Vaziri.
Linear Programming Models in Services
Chapter 10. Resource Allocation
Graduate Program in Business Information Systems Integer and Goal Programming Aslı Sencer.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Kerimcan OzcanMNGT 379 Operations Research1 LP: Sensitivity Analysis and Interpretation of Solution Chapter 3.
Product Mix Problem Monet company makes four types of frames.
Robert Delgado Chris Mui Amanda Smith Presented to: Dr. Sima Parisay Due: October 20 th, 2011 California State Polytechnic University, Pomona.
1 OM2, Supplementary Ch. C Modeling Using Linear Programming ©2010 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
1 1 Slide © 2005 Thomson/South-Western Chapter 4 Linear Programming Applications n Portfolio Planning Problem n Product Mix Problem n Blending Problem.
Lecture 2 Chapter 10 continued…. Last Lecture Summary: Covered Sec and most part of Sec Basic concepts of Linear Programming Problem and.
Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
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.
Chapter 7 Transportation, Assignment & Transshipment Problems
Operations Research I IE 416 California State Polytechnic University, Pomona Operations Research I IE 416 California State Polytechnic University, Pomona.
Model 2: Transportation Problem Roshnika Fernando.
LINEAR PROGRAMMING APPLICATIONS IN MARKETING, FINANCE, AND OPERATIONS MANAGEMENT (2/3) Chapter 4 MANGT 521 (B): Quantitative Management.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Goal Programming Linear program has multiple objectives, often conflicting in nature Target values or goals can be set for each objective identified Not.
Optimization I. © The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran2 Outline Basic Optimization: Linear programming –Graphical.
Objectives:  Use the utility-maximizing model to explain how consumers choose goods and services.  Use the concept of utility to explain how the law.
Table of Contents CD Chapter 17 (Goal Programming)
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Business Mathematics MTH-367 Lecture 13. Chapter 10 Linear Programming An Introduction Continued…
Log Truck Scheduling Problem
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.
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 Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
Linear Programing Problem
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Goal programming.
BIA 674 – Supply Chain Analytics
Presentation by Team 2.
Duality Theory and Sensitivity Analysis
Chapter 8 Goal Programming.
Goal Programming How do you find optimal solutions to the following?
Linear Programming Applications in Services
Linear Programming Problem
Goal Programming: Example 1 on Page 191 Show HIM LIP HIW Cost/min
Goal Programming: Example 1 on Page 191 Show HIM LIP HIW Cost/min
Presentation transcript:

Team 9 Jin woo Choi Philip Liu Nallely Tagle IE 416: Operations Research I Problem #2 Page 199 Fruit Computer Company Think Efficient® Team 9 Jin woo Choi Philip Liu Nallely Tagle Presentation Date: November 15th, 2011

Table of Contents Problem Statement Summary of the Problem Formulation of the Problem Solution using WinQSB - LP Report to Manager Solution using WinQSB - GP Sensitivity Analysis - GP

Characteristics of a Lot of 100 Chips Problem Statement Problem #2 Pg. 199 Fruit Computer Company Fruit Computer Company is ready to make its annual purchase of computer chips from suppliers 1, 2, and 3. Characteristics of a Lot of 100 Chips Supplier Excellent Good Mediocre Price Per 100 Chips ($) 1 60 20 $400 2 50 35 15 $300 3 40 $250

Problem Summary Table Suppliers Excellent Good Mediocre Price Per Lot Characteristics of a Lot (100 Chips per lot) Suppliers Excellent Good Mediocre Price Per Lot (100 Chips ) Price per chip Supplier 1 60 20 $400 $4.00 Supplier 2 50 35 15 $300 $3.00 Supplier 3 40 $250 $2.50 Total ≥ 5,000 ≥ 3,000 ≥ 1,000 ≤ $28,000 Price of Special Order per Chip (Penalty Cost) $10/chip $6/chip $4/chip $1 for every dollar over budget

Assumption It was assumed that Fruit Computer Company has additional funds that can be allocated towards the annual budget if it is necessary.

Formulation of the Problem Decision Variables Let Xi : number of lots provided by Supplieri (where i = 1, 2, and 3) Deviational Variables: Si- : amount that goali is under (goal is not achieved and where i = 1, 2, 3, and 4) Si+ : amount that goali is over (goal has been passed and where i = 1, 2, 3, and 4) Note: Goals refer to maintaining the budget and achieving the desired demand of excellent, good, and mediocre chips.

Formulation of the Problem Initial Constraints: 1) At least 5,000 Excellent Chips from Suppliers 1, 2, 3: 60X1 + 50X2 + 40X3 ≥ 5,000 2) At least 3,000 Good Chips from Suppliers 1, 2, 3: 20X1 + 35X2 + 20X3 ≥ 3,000 3) At least 1,000 Mediocre Chips from Suppliers 1, 2, 3: 20X1 + 15X2 + 40X3 ≥ 1,000

Formulation of the Problem Initial Constraints Continued: 4) Total cost of orders from Suppliers 1, 2, and 3 should not exceed Fruit’s budget of $28,000. 400X1 + 300X2 + 250X3 ≤ 28,000 5) Fruit does not ship any chips, it only receives: Xi, Si-, Si+ ≥ 0

Formulation of the Problem Objective Function: Penalty cost for LP Min Z = 10S1- +6S2- + 4 S3- + 1 S4+ For GP Order of importance: Budget (S4+) >> Excellent (S1-) >> Good (S2-) >> Mediocre (S3-) Min. Z1 = P1* S4+ Min. Z2 = P2 * S1- Min. Z3 = P3 * S2- Min. Z4 = P4 * S3- Constraints with Deviational Variables: 1) 60X1 + 50X2 + 40X3 +S1- – S1+ = 5,000 2) 20X1 + 35X2 + 20X3 +S2- – S2+ = 3,000 3) 20X1 + 15X2 + 40X3 + S3- – S3+ = 1,000 4) 400X1 + 300X2 +250X3 + S4- –S4+ = 28,000

WinQSB for Linear Programming: Input

WinQSB for Linear Programming: Output

Report to Manager (Summary Table) Information Fruit's Requirements Deviation from Requirements Penalty Cost Quantity of excellent chips ≥ 5,000 Goal is met $0.00 Quantity of good chips ≥ 3,000 Goal exceeded by 500 Quantity of mediocre chips ≥ 1,000 Annual Budget ≤ $28,000 Goal exceeded by $2,000 $2,000.00 Total Penalty Cost   Information Results Purchase from Supplier Supplier 2 Quantity of Lots Purchased 100 lots at $300 per lot Quantity of Each Chip Obtained 5,000 excellent chips, 3,500 good chips, and 1,500 mediocre chips Total Cost (100 lots) * ($300/lot) = $30,000

Report to Manager - LP The current budget of $28,000 will have to be raised to $30,000 to accommodate this purchase order. To minimize the penalty cost , purchase 100 lots of chips from Supplier 2. The company will have 5,000 excellent chips, 3,500 good chips and 1,500 mediocre chips. The reason for ordering extra chips: No penalty cost for having overstock.

Preemptive Goal Programming Priority Goals 1st The budget of $28,000 is not exceeded 2nd At least 5,000 excellent chips are purchased 3rd At least 3,000 good chips are purchased 4th At least 1,000 mediocre chips are purchased

WinQSB for Preemptive Goal Programming: Input

WinQSB for Preemptive Goal Programming: Output

Report to Manager (Summary Table) Supplier Quantity of Lots Quantity of excellent chips Quantity of good chips Quantity of mediocre Chips Cost ($) 1 10 600 200 $4,000.00 2 80 4,000 2,800 1,200 $24,000.00 3 $0.00 Total N/A 4,600 3,000 1,400 $28,000.00 Quantity of excellent chips Quantity of good chips Quantity of mediocre chips Cost ($) Goal 5,000 3,000 1,000 $0.00 Deviation from Requirements Goal is not met by 400 chips Goal is met Goal is exceeded by 400 chips

Report to Manager Fruit will be able to achieve only three of the specified four goals (the goal of excellent chip will not be met). The goal for excellent chips will be short by 400 chips. The goal for mediocre chips will be exceeded by 400 chips. If Fruit decides to fulfill all goals, the company should buy 100 lots of chips from Supplier 2. (Explained in the Report to Manager for Linear Programming.)

Scenario 2 (SA for Preemptive Goal Programming ) Sensitivity analysis was performed for the equation by changing the priority levels of the goals. Scenario 2 Priority Goals 1st At least 5,000 excellent chips are purchased 2nd At least 3,000 good chips are purchased 3rd At least 1,000 mediocre chips are purchased 4th The budget of $28,000 is not exceeded

Scenario 2: Input (SA for Preemptive Goal Programming )

Scenario 2: Output (SA for Preemptive Goal Programming )

Scenario 3 (SA for Preemptive Goal Programming ) Priority Goals 1st At least 1,000 mediocre chips are purchased 2nd At least 3,000 good chips are purchased 3rd At least 5,000 excellent chips are purchased 4th The budget of $28,000 is not exceeded

Scenario 3: Input (SA for Preemptive Goal Programming )

Scenario 3: Output (SA for Preemptive Goal Programming )

Scenario 4 (SA for Preemptive Goal Programming ) Priority Goals 1st At least 3,000 good chips are purchased 2nd At least 1,000 mediocre chips are purchased 3rd At least 5,000 excellent chips are purchased 4th The budget of $28,000 is not exceeded

Scenario 4: Input (SA for Preemptive Goal Programming )

Scenario 4: Output (SA for Preemptive Goal Programming )

Scenario 5 (SA for Preemptive Goal Programming ) Priority Goals 1st The budget of $28,000 is not exceeded 2nd At least 1,000 mediocre chips are purchased 3rd At least 3,000 good chips are purchased 4th At least 5,000 excellent chips are purchased

Scenario 5 (SA for Preemptive Goal Programming )

Scenario 5 (SA for Preemptive Goal Programming)

Sensitivity Analysis Summary Optimal Solution Priority of Goals Lots Purchased from Suppliers Deviation Highest Second Third Lowest 1 2 3 Z1 Z2 Z3 Z4 Budget Excellent Good Mediocre 10 80 -400 400 100 500 2000

QUESTIONS? COMMENTS?