Sherwood Furniture Company

Slides:



Advertisements
Similar presentations
MT 2351 Chapter 2 An Introduction to Linear Programming.
Advertisements

Solving LP Problems in a Spreadsheet
Linear Programming Sensitivity Analysis How will a change in a coefficient of the objective function affect the optimal solution? How will a change in.
LINEAR PROGRAMMING SENSITIVITY ANALYSIS
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Linear Programming Problem
Assignment (6) Simplex Method for solving LP problems with two variables.
Linear Programming Models & Case Studies
Chapter 9 Question 2 [Anisha Patel]
Optimization Models Module 9. MODEL OUTPUT EXTERNAL INPUTS DECISION INPUTS Optimization models answer the question, “What decision values give the best.
Chapter 5 Linear Inequalities and Linear Programming
Learning Objectives for Section 5.3
Chapter 5 Linear Inequalities and Linear Programming Section 3 Linear Programming in Two Dimensions: A Geometric Approach.
19 Linear Programming CHAPTER
Chapter 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
Linear Programming Unit 2, Lesson 4 10/13.
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.
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
EMGT 501 HW #1 Due Day: Sep 13 Chapter 2 - SELF TEST 18
B-1 Operations Management Linear Programming Module B.
D1: Linear Programming.
Linear Programming Models in Services. Stereo Warehouse Let x = number of receivers to stock y = number of speakers to stock Maximize 50x + 20y gross.
Linear Programming Example 2 Alternate Optimal Solutions.
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
The Master Budget and Flexible Budgeting
Module B: Linear Programming
Product Mix & Master Production Scheduling
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
 A concert promoter wants to book a rock group for a stadium concert. A ticket for admission to the stadium playing field will cost $125, and a ticket.
Introduction to Linear Programming BSAD 141 Dave Novak.
Opener. Notes: 3.4 Linear Programming Optimization  Many real-life problems involve a process called optimization.  This means finding a maximum or.
QMB 4701 MANAGERIAL OPERATIONS ANALYSIS
A LINEAR PROGRAMMING PROBLEM HAS LINEAR OBJECTIVE FUNCTION AND LINEAR CONSTRAINT AND VARIABLES THAT ARE RESTRICTED TO NON-NEGATIVE VALUES. 1. -X 1 +2X.
Example 8 Manufacturing Chapter 7.4 Sharper Technology Company manufactures three types of calculators, a business calculator, a scientific calculator,
1 The Geometry of Linear Programs –the geometry of LPs illustrated on GTC Handouts: Lecture Notes February 5, 2002.
Simplex Method for solving LP problems with two variables.
LINEAR PROGRAMMING.
Ch. 3 Notes Page 19 P19 3.4b: Linear Programming.
GUIDED PRACTICE for Example – – 2 12 – 4 – 6 A = Use a graphing calculator to find the inverse of the matrix A. Check the result by showing.
Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Chapter 8 Systems of Linear Equations in Two Variables Section 8.3.
GOOD MORNING CLASS! In Operation Research Class, WE MEET AGAIN WITH A TOPIC OF :
Chapter 4 The Simplex Algorithm and Goal Programming
Problem solving Chapter 3
Alex’s Furniture Warehouse Linear Programming for a Furniture Company.
MID-TERM EXAM/REVISION
3.3 and 3.4 Applications of Linear Models
Introduction to Linear Programs
Chapter 5 Linear Inequalities and Linear Programming
The use of linear programming for the allocation of scarce resources
Solve a system of linear equation in two variables
Linear Programming Objectives: Set up a Linear Programming Problem
Linear Programming SIMPLEX METHOD.
The Master Budget and Flexible Budgeting
5.1 Solving Systems of Equations by Graphing
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Linear Programming Problem
Optimization Models Module 9.
Systems of Equations Solve by Graphing.
Chapter 4 The Simplex Algorithm
Example 5A: Solving Simple Rational Equations
Linear Programming Mr. Carpenter Alg. 2.
Linear Programming.
Applied Statistical and Optimization Models
Presentation transcript:

Sherwood Furniture Company Recently, Sherwood Furniture Company has been interested in developing a new line of stereo speaker cabinets. In the coming month, Sherwood expects to have excess capacity in its Assembly and Finishing departments and would like to experiment with two new models. One model is the Standard, a large, high-quality cabinet in a traditional design that can be sold in virtually unlimited quantities to several manufacturers of audio equipment. The other model is the Custom, a small, inexpensive cabinet in a novel design that a single buyer will purchase on an exclusive basis. Under the tentative terms of this agreement, the buyer will purchase as many Customs as Sherwood produces, up to 32 units. The Standard requires 4 hours in the Assembly Department and 8 hours in the Finishing Department, and each unit contributes $20 to profit. The Custom requires 3 hours in Assembly and 2 hours in Finishing, and each unit contributes $10 to profit. Current plans call for 120 hours to be available next month in Assembly and 160 hours in Finishing for cabinet production, and Sherwood desires to allocate this capacity in the most economical way. Linear Programming

Sherwood Furniture Company – Linear Equations Linear Programming

Sherwood Furniture Company – Graph Solution Linear Programming

Sherwood Furniture Company – Graph Solution Constraint 1 Linear Programming

Sherwood Furniture Company – Graph Solution Constraint 1 Linear Programming

Sherwood Furniture Company – Graph Solution Constraint 2 Linear Programming

Sherwood Furniture Company – Graph Solution Constraint 1 & 2 Linear Programming

Sherwood Furniture Company – Graph Solution Constraint 3 Linear Programming

Sherwood Furniture Company – Graph Solution Constraint 1, 2 & 3 Linear Programming

Sherwood Furniture Company – Graph Solution Linear Programming

Sherwood Furniture Company – Graph Solution Linear Programming

Sherwood Furniture Company – Solve Linear Equations Linear Programming

Sherwood Furniture Company – Solve Linear Equations Linear Programming

Sherwood Furniture Company – Solve Linear Equations Linear Programming

Sherwood Furniture Company – Graph Solution Optimal Point (15, 20) Linear Programming

Sherwood Furniture Company – Slack Calculation Linear Programming

Sherwood Furniture Company - Slack Variables Max 20x1 + 10x2 + 0S1 + 0S2 + 0S3 s.t. 4x1 + 3x2 + 1S1 = 120 8x1 + 2x2 + 1S2 = 160 x2 + 1S3 = 32 x1, x2, S1 ,S2 ,S3 >= 0 Linear Programming

Sherwood Furniture Company – Graph Solution 3 1 2 Linear Programming

Sherwood Furniture Company – Slack Calculation Point 1 Linear Programming

Sherwood Furniture Company – Graph Solution 3 1 2 Linear Programming

Sherwood Furniture Company – Slack Calculation Point 2 Linear Programming

Sherwood Furniture Company – Graph Solution 3 1 2 Linear Programming

Sherwood Furniture Company – Slack Calculation Point 3 Linear Programming

Sherwood Furniture Company – Slack Calculation Points 1, 2 & 3 Linear Programming

Sherwood Furniture Company – Slack Variables For each ≤ constraint the difference between the RHS and LHS (RHS-LHS). It is the amount of resource left over. Constraint 1; S1 = 0 hrs. Constraint 2; S2 = 0 hrs. Constraint 3; S3 = 12 Custom Linear Programming