CDAE 266 - Class 13 Oct. 10 Last class: Result of Quiz 3 3. Linear programming and applications Class exercise 5 Today: 3. Linear programming and applications.

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 (LP)
LINEAR PROGRAMMING SENSITIVITY ANALYSIS
Linear Programming.
Linear Programming Problem
Linear Programming (LP) Decision Variables Objective (MIN or MAX) Constraints Graphical Solution.
LINEAR PROGRAMMING (LP)
Chapter 2: Modeling with Linear Programming & sensitivity analysis
8/27: Linear Programming Lecture: LP Small Groups Homework.
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
Chapter 8: Linear Programming
1 Spreadsheet Modeling & Decision Analysis: A Practical Introduction to Management Science 3d edition by Cliff Ragsdale.
Linear Programming Unit 2, Lesson 4 10/13.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 6 th edition Cliff T. Ragsdale © 2011 Cengage Learning. All Rights.
Linear Programming Solution Techniques: Graphical and Computer Methods
Linear Programming Introduction. linear function linear constraintsA Linear Programming model seeks to maximize or minimize a linear function, subject.
Linear and Integer Programming Models
6s-1Linear Programming CHAPTER 6s Linear Programming.
D1: Linear Programming.
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
Linear Programming.
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
9/1 More Linear Programming Collect homework Roll call Review homework Lecture - More LP Small Groups Lecture - Start using MS Excel Assign Homework.
1-1 Introduction to Optimization and Linear Programming Chapter 1.
3.4 Linear Programming.
Chapter 15 Constrained Optimization. The Linear Programming Model Let : x 1, x 2, x 3, ………, x n = decision variables Z = Objective function or linear.
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 -
Linear Programming. What is Linear Programming? Say you own a 500 square acre farm. On this farm you can grow wheat, barley, corn or some combination.
BUSINESS MATHEMATICS & STATISTICS. LECTURE 45 Planning Production Levels: Linear Programming.
1/17: DSCB Getting Started, Linear Programming Administrative Issues –Syllabus –Calendar –Get usernames, addresses, majors Linear Programming.
Opener. Notes: 3.4 Linear Programming Optimization  Many real-life problems involve a process called optimization.  This means finding a maximum or.
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.
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.
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.
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 1 n X n
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
1 A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear constraints. The linear model consists of the.
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
3.4: Linear Programming Objectives: Students will be able to… Use linear inequalities to optimize the value of some quantity To solve linear programming.
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.
CDAE Class 15 Oct. 16 Last class: Result of group project 1 3. Linear programming and applications Class Exercise 7 Today: 3. Linear programming.
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.
1 Linear Programming 2 A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear constraints. The linear.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Spreadsheet Modeling & Decision Analysis:
Linear Programming in Two Dimensions
Linear Programming Objectives: Set up a Linear Programming Problem
Spreadsheet Modeling & Decision Analysis
Linear Programming Example: Maximize x + y x and y are called
Linear Programming Introduction.
Optimization Theory Linear Programming
Linear Programming Introduction.
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Spreadsheet Modeling & Decision Analysis:
Presentation transcript:

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 Next class: 3. Linear programming and applications Quiz 4 (Sections 3.2 and 3.3) Reading: Linear Programming

CDAE Class 13 Oct. 10 Important dates: Problem set 2 due today Midterm exam:

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.2. How to develop a LP model? Major steps in developing a LP model: (1) Define decision variables (2) Express the objective function (3) Express the constraints (4) Complete the LP model Three examples: (1) Furniture manufacturer (2) Galaxy industrials (3) A farmer in Iowa

Example 3. A farmer in Iowa has 500 acres of land which can be used to grow corn and/or soybeans. The per acre net profit is $20 for soybeans and $18 for corn. In addition to the land constraint, the farmer has limited labor resources: 200 hours for planting and 160 hours for cultivation and harvesting. Labor required for planting is 0.6 hour per acre for corn and 0.5 hour per acre for soybean. Labor required for cultivation and harvesting is 0.8 hour per acre for corn and 0.3 hour per acre for soybeans. If the farmer’s objective is to maximize the total profit, develop a LP model that can be used to determine how many acres of soy and how many acres of corn to be planted.

Class Exercise 5 (Thursday, Oct. 5) Best Brooms is a small company that produces two difference brooms: one with a short handle and one with a long handle. Suppose each short broom requires 1 hour of labor and 2 lbs. of straw and each long broom requires 0.8 hour of labor and 3 lbs. of straws. We also know that each short broom brings a profit of $10 and each long broom brings a profit of $8 and the company has a total of 500 hours of labor and 1500 lbs of straw. Develop a LP model for the company to maximize its total profit.

3.3. How to solve a LP model graphically? Review of some basic math techniques: (1) How to plot a linear equation? e.g., Y = X 2X + 3Y = 6 X = 3 Y = 4 X = 0 Y = 0

3.3. How to solve a LP model graphically? Review of some basic math techniques: (2) How to plot an inequality e.g., 2X + 3Y < 12 3X < 15 4Y > 8 X > 0 Y > 0

3.3. How to solve a LP model graphically? Review of some basic math techniques: (3) How to solve a system of two equations? e.g., 30X + 20Y = 300 5X + 10 Y = 110 Step 1. Try to get ride of one variable (e.g., X) and get the solution for the other variable (e.g., Y) Step 2. Substitute the solution for the variable (e.g., Y) back into any equation and get the solution for the other variable (X)

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? The optimal point IS NOT always the intersecting point 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 2. How do I pick up a starting value for the obj. function?

Take-home exercise 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 = ?