Linear Programming Models in Services. Stereo Warehouse Let x = number of receivers to stock y = number of speakers to stock Maximize 50x + 20y gross.

Slides:



Advertisements
Similar presentations
Linear Programming Sensitivity Analysis How will a change in a coefficient of the objective function affect the optimal solution? How will a change in.
Advertisements

1Introduction to Linear ProgrammingLesson 2 Introduction to Linear Programming.
LINEAR PROGRAMMING (LP)
Linear Programming We are to learn two topics today: LP formulation
Linear Programming.
Linear Programming – Sensitivity Analysis How much can the objective function coefficients change before the values of the variables change? How much can.
Sherwood Furniture Company
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
Dr. Ayham Jaaron First semester 2013/2014 August 2013
19 Linear Programming CHAPTER
(1/24 and 1/27) Bellwork: 1)List 2 things we’ve discussed this semester 2)What is one positive thing you’d be willing to share?
LPX-1. Linear Programming Models in Services Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
Introduction to Management Science
6s-1Linear Programming CHAPTER 6s Linear Programming.
Sensitivity of the Objective Function Coefficients
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
Linear Programming: Computer Solution and Sensitivity Analysis
Introduction to Management Science
Linear Programming Models in Services
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
Evaluating Constrained Resources w/ Linear Programming
Linear Programming Sensitivity of the Objective Function Coefficients.
Chapter 15 Constrained Optimization. The Linear Programming Model Let : x 1, x 2, x 3, ………, x n = decision variables Z = Objective function or linear.
Readings Readings Chapter 3
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Chapter Topics Computer Solution Sensitivity Analysis
FUNCTIONS Algebra I C. Toliver.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
Table of Contents Chapter 6.8 (Sensitivity Analysis with Solver Table) Continuing the Wyndor Case Study Changes in One Objective Function Coefficient Simultaneous.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
Chapter 6 Supplement Linear Programming.
Parametric Linear Programming-1 Parametric 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.
Linear Programming – Simplex Method
Linear Programming. Many mathematical models designed to solve problems in business, biology, and economics involve finding the optimum value (maximum.
3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.
Linear Programming with Excel Solver.  Use Excel’s Solver as a tool to assist the decision maker in identifying the optimal solution for a business decision.
Linear Programming Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
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 Max 8X 1 + 5X 2 (Weekly profit) subject to 2X 1 + 1X 2  1000 (Plastic) 3X 1 + 4X 2  2400 (Production Time) X 1 + X 2  700 (Total production) X 1.
10/2 The simplex algorithm. In an augmented matrix, if a column has a 1 and all other entries 0, it is said to be ‘in solution’. The 1 is called a ‘pivot’
December 4, 2015 Hanging with Harvard 4 L INEAR P ROGRAMMING.
5-1 Copyright © 2013 Pearson Education Integer Programming: The Branch and Bound Method Module C.
Differential Equations Linear Equations with Variable Coefficients.
Managerial Economics Linear Programming Aalto University School of Science Department of Industrial Engineering and Management January 12 – 28, 2016 Dr.
3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3-Part1.
Linear Programming Wyndor Glass Co. 3 plants 2 new products –Product 1: glass door with aluminum framing –Product 2: 4x6 foot wood frame window.
Don Sutton Spring LP Basic Properties Objective Function – maximize/minimize profit/cost Resource Constraints – labor, money Decision.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
Operations Research.  Operations Research (OR) aims to having the optimization solution for some administrative problems, such as transportation, decision-making,
Alex’s Furniture Warehouse Linear Programming for a Furniture Company.
Linear Programming Technical Supplement 1 Linear Programming Copyright © 2014 by the McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
Linear Programming for Solving the DSS Problems
Managerial Economics Linear Programming
Introduction to Linear Programs
Goal programming.
Determining the optimal solution to a real-world engineering problem
Constrained Optimization
السيولة والربحية أدوات الرقابة المالية الوظيفة المالية
The application of mathematics and the scientific
Sensitivity Analysis and
Sensitivity.
Max Z = x1 + x2 2 x1 + 3 x2  6 (1) x2  1.5 (2) x1 - x2  2 (3)
Linear Programming Applications in Services
Linear Programming Example: Maximize x + y x and y are called
Section 3.4 Sensitivity Analysis.
Linear Programming Mr. Carpenter Alg. 2.
Operations Research.
Linear Programming: Computer Solution and Sensitivity Analysis
Presentation transcript:

Linear Programming Models in Services

Stereo Warehouse Let x = number of receivers to stock y = number of speakers to stock Maximize 50x + 20y gross profit Subject to 2x + 4y 400 floor space 100x + 50y 8000 budget x 60 sales limit x, y 0

Graphical Solution Stereo Warehouse Z=2000 Z=3000 Z=3600 Z=3800 A B C D E Optimal solution ( x = 60, y = 40)

Model in Standard Form Let s 1 = square feet of floor space not used s 2 = dollars of budget not allocated s 3 = number of receivers that could have been sold Maximize Z = 50x + 20y subject to 2x + 4y + s 1 = 400 (constraint 1) 100x + 50y + s 2 = 8000 (constraint 2) x + s 3 = 60 ( constraint 3) x, y, s 1, s 2, s 3 0

Stereo Warehouse Extreme-Point Solutions Extreme Nonbasic Basic Variable Objective-function point variables variables value value Z A x, y s s s 3 60 B s 3, y s s x 60 C s 3, s 2 s y 40 x 60 D s 1, s 2 s y 80 x 40 E s 1, x s y 100 s

Sensitivity Analysis Objective-Function Coefficients z = 50x + 20y (constraint 3 ) (constraint 1) (constraint 2) A B C D

Sensitivity Analysis Right-Hand-Side Ranging (constraint 3 ) (constraint 2) A BI C D H