CDAE 266 - Class 15 Oct. 16 Last class: Result of group project 1 3. Linear programming and applications Class Exercise 7 Today: 3. Linear programming.

Slides:



Advertisements
Similar presentations
© 2003 Anita Lee-Post Linear Programming Part 2 By Anita Lee-Post.
Advertisements

1Introduction to Linear ProgrammingLesson 2 Introduction to Linear Programming.
Linear Programming Problem
LINEAR PROGRAMMING (LP)
LINEAR PROGRAMMING SENSITIVITY ANALYSIS
Lesson 08 Linear Programming
Linear Programming.
Linear Programming (LP) Decision Variables Objective (MIN or MAX) Constraints Graphical Solution.
Chapter 2: Modeling with Linear Programming & sensitivity analysis
Linear Programming Sensitivity of the Right Hand Side Coefficients.
Managerial Decision Modeling with Spreadsheets
Dr. Ayham Jaaron First semester 2013/2014 August 2013
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
Chapter 8: Linear Programming
Linear Programming Solution Techniques: Graphical and Computer Methods
INFM 718A / LBSC 705 Information For Decision Making Lecture 4.
QM B Linear Programming
Linear and Integer Programming Models
6s-1Linear Programming CHAPTER 6s Linear Programming.
LINEAR PROGRAMMING SENSITIVITY ANALYSIS
LINEAR PROGRAMMING SOLUTION TECHNIQUES: GRAPHICAL AND COMPUTER METHODS
Linear Programming.
Graphical Solutions Plot all constraints including nonnegativity ones
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
Linear Programming Models: Graphical and Computer Methods
Goals and aims To introduce Linear Programming To find a knowledge on graphical solution for LP problems To solve linear programming problems using excel.
Graduate Program in Business Information Systems Linear Programming: Sensitivity Analysis and Duality Aslı Sencer.
EXAMPLE: 3.1 ASSEMBLING AND TESTING COMPUTERS
Chapter 2 Linear Programming Models: Graphical and Computer Methods
3.4 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.
Lesson 9.7 Solve Systems with Quadratic Equations
1 Chapter 8 Linear programming is used to allocate resources, plan production, schedule workers, plan investment portfolios and formulate marketing (and.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
Linear and Integer Programming Models 1 Chapter 2.
1 1 Slide Linear Programming (LP) Problem n A mathematical programming problem is one that seeks to maximize an objective function subject to constraints.
1 Additional examples LP Let : X 1, X 2, X 3, ………, X n = decision variables Z = Objective function or linear function Requirement: Maximization of the.
CDAE Class 11 Oct. 3 Last class: Result of Quiz 2 2. Review of economic and business concepts Today: Result of Quiz 2 3. Linear programming and applications.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
CDAE Class 12 Oct. 5 Last class: Quiz 3 3. Linear programming and applications Today: Result of Quiz 3 3. Linear programming and applications Next.
1/24: Linear Programming & Sensitivity Analysis Review: –LP Requirements –Graphical solutions Using MS Excel for Linear Programming Sensitivity Analysis.
CDAE Class 17 Oct. 23 Last class: Result of Quiz 4 3. Linear programming and applications Today: 3. Linear programming and applications Review for.
LP: Summary thus far Requirements Graphical solutions Excel Sensitivity Analysis.
QMB 4701 MANAGERIAL OPERATIONS ANALYSIS
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.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 3 Basics of the Simplex Algorithm.
Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization Problem n Graphical Solution Procedure.
CDAE Class 13 Oct. 10 Last class: Result of Quiz 3 3. Linear programming and applications Class exercise 5 Today: 3. Linear programming and applications.
CDAE Class 11 Oct. 2 Last class: 2. Review of economic and business concepts Today: 2. Review of economic and business concepts 3. Linear programming.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
CDAE Class 20 Nov. 2 Last class: Results of the midterm exam 4. Queuing analysis and midterm exam Today: 4. Queuing analysis and applications Next.
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 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Linear Programming (LP) Problems MAX (or MIN): c 1 X 1 + c 2 X 2 + … + c n X n Subject to:a 11 X 1 + a 12 X 2 + … + a 1n X n
Adeyl Khan, Faculty, BBA, NSU 1 Introduction to Linear Programming  A Linear Programming model seeks to maximize or minimize a linear function, subject.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
CDAE Class 16 Oct. 18 Last class: 3. Linear programming and applications Quiz 4 Today: Result of Quiz 4 3. Linear programming and applications Group.
© 2009 Prentice-Hall, Inc. 7 – 1 Decision Science Chapter 3 Linear Programming: Maximization and Minimization.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
Don Sutton Spring LP Basic Properties Objective Function – maximize/minimize profit/cost Resource Constraints – labor, money Decision.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Linear Programming in Two Dimensions
Max Z = x1 + x2 2 x1 + 3 x2  6 (1) x2  1.5 (2) x1 - x2  2 (3)
Linear Programming Problem
Optimization Theory Linear Programming
BUS-221 Quantitative Methods
Presentation transcript:

CDAE Class 15 Oct. 16 Last class: Result of group project 1 3. Linear programming and applications Class Exercise 7 Today: 3. Linear programming and applications Quiz 4 (sections 3.1, 3.2 and 3.3) Next class: 3. Linear programming Group project 2 (read the project and develop a LP model before the class)

CDAE Class 15 Oct. 16 Important dates: Problem set 3: due Tuesday, Oct. 23 Problems 8-1, 8-2, 8-3, 8-5 and 8-14 (pp and 3-30) Group project 2 (case 1 on page 3-31): due Tuesday, Oct. 23 Midterm exam: Thursday, Oct. 25

3. Linear programming & applications 3.1. What is linear programming (LP)? 3.2. How to develop a LP model? 3.3. How to solve a LP model graphically? 3.4. How to solve a LP model in Excel? 3.5. How to do sensitivity analysis? 3.6. What are some special cases of LP?

3.3. How to solve a LP model graphically? Major steps of solving a LP model graphically: (1) Plot each constraint (2) Identify the feasible region (3) Plot the objective function (4) Move the objective function to identify the “optimal point” (most attractive corner) (5) Identify the two constraints that determine the “optimal point” (6) Solve the system of 2 equations (7) Calculate the optimal value of the objective function.

3.3. How to solve a LP model graphically? Example 1 -- Furniture Co. X T = Number of tables X C = Number of chairs Maximize P = 6X T + 8X C subject to: 30X T + 20X C < 300 (wood) 5X T + 10X C < 110 (labor) X T > 0 X C > 0

3.3. How to solve a LP model graphically? Example 1 (1) Plot each constraint (a) X T > 0 (b) X C > 0 (c) 30X T + 20X C < 300 (wood) (d) 5X T + 10X C < 110 (labor) (2) Find the feasible region (3) Plot the objective function (4) Move the objective function to identify the optimal point (most attractive corner)

3.3. How to solve a LP model graphically? Example 1 (5) Identify the two constraints that determine the “optimal point” (6) Solve the system of 2 equations 30X T + 20X C = 300 (wood) 5X T + 10X C = 110 (labor) Solution: X T =, X C = (7) Calculate the optimal value of the objective function. P = 6X T + 8X C =

3.3. How to solve a LP model graphically? Example 2 -- Galaxy Industries X S = Number of space ray X Z = Number of zappers Maximize P = 8X S + 5X Z subject to 2X S + 1X Z < 1200 (plastic) 3X S + 4X Z < 2400 (labor) X S + X Z < 800 (total) X S < X Z (mix) X S > 0 X Z > 0

Xz The Plastic constraint Feasible Xs Plastic constraint Infeasible Labor constraint Total production constraint Production mix constraint

Recall the feasible region Xz Xs We now demonstrate the search for an optimal solution Start at some arbitrary profit, say profit = $2, Profit = $ 000 2, Then increase the profit, if possible... 3, 4, … and continue until it becomes infeasible Profit =$5040

Xz Xs Let’s take a closer look at the optimal point Feasible region Feasible region

Questions: 1. Why do we need to plot the objective function? (a) The optimal point IS NOT always the intersecting point when you have two straight-line constraints For example: Maximize P = 9X T + 3X C subject to: 30X T + 20X C < 300 wood 5X T + 10X C < 110 labor X T > 0, X C > 0 (b) There could be more than two straight-line constraints (see example 2) 2.How do I pick up a starting value to draw the objective function?

Class Exercise 7 (Thursday, Oct. 11) Solve the following LP model graphically: X = Number of product A, Y = number of product B Maximize P = 3X + 9Y subject to 30X + 20Y < 300 5X + 10Y < 110 X > 0, Y > 0 X* = ? Y* = ? P = ? (Try P = 27 to draw the objective function)

Take-home Exercise (Thursday, Oct. 11) Solve the following LP model graphically: X T = Number of tables X C = Number of chairs Maximize P = 6X T + 8X C subject to: 40X T + 20X C < 280 (wood) 5X T + 10X C < 95 (labor) X T > 0 X C > 0 X T = ? X C = ? P = ?

3.4. How to solve a LP model in Excel? Check the Excel program

3.4. How to solve a LP model in Excel? Enter the data & formulas (Example 2 -- Galaxy Industries) X 1 = Number of space ray X 2 = Number of zappers Maximize P = 8X 1 + 5X 2 subject to 2X 1 + 1X 2 < 1200 (plastic) 3X 1 + 4X 2 < 2400 (labor) X 1 + X 2 < 800 (total) X 1 - X 2 < 450 (mix) X 1 > 0 X 2 > 0

3.4. How to solve a LP model in Excel? Solve the model and obtain computer reports -- Answer report -- Sensitivity report -- Limits report

3.5. How to interpret computer reports and conduct sensitivity analysis? Answer report (1) Optimal solution for X 1 and X 2 (2) Optimal value of the objective function (3) “Original value” (4) “Cell value” or LHS value (5) “Status” of each constraint (6) “Slack” of each constraint (Relation between “status” & “slack”)

Take home exercise Solve the following LP model in Excel and obtain the “answer report” and “sensitivity report” X1 = Number of space ray X2 = Number of zappers Maximize P = 8X1 + 5X2 subject to 2X1 + 1X2 < 1200 (plastic) 3X1 + 4X2 < 2400 (labor) X1 + X2 < 800 (total) X1 - X2 < 450 (mix) X1 > 0 X2 > 0