1/17: DSCB-305-50 Getting Started, Linear Programming Administrative Issues –Syllabus –Calendar –Get usernames, email addresses, majors Linear Programming.

Slides:



Advertisements
Similar presentations
2.7 Linear Programming.
Advertisements

1Introduction to Linear ProgrammingLesson 2 Introduction to Linear Programming.
LINEAR PROGRAMMING (LP)
Linear Programming Problem
2-1 Linear Programming: Model Formulation and Graphical Solution Chapter 2 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
Learning Objectives for Section 5.3
8/27: Linear Programming Lecture: LP Small Groups Homework.
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
19 Linear Programming CHAPTER
Operations Management Dr. Ron Lembke
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 7-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 7 Linear.
Operations Management
Introduction to Management Science
B-1 Operations Management Linear Programming Module B.
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
Linear and Integer Programming Models
B-1 Operations Management Linear Programming Module B.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Linear Programming: Model Formulation and Graphical Solution
Linear Programming Example 2 Alternate Optimal Solutions.
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
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© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
3.4 Linear Programming.
Department of Business Administration
Module B: Linear Programming
Operations Management
___________________________________________________________________________ Operations Research  Jan Fábry Linear Programming.
Do the algebra required to find a simultaneous solutions to these two equations (from last class): 3x 1 + x 2  3 x 1 + 3x 2  5 1.
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 -
___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry 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.
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 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.
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.
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
Saba Bahouth 1 Supplement 6 Linear Programming. Saba Bahouth 2  Scheduling school busses to minimize total distance traveled when carrying students 
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.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
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.
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
CDAE Class 15 Oct. 16 Last class: Result of group project 1 3. Linear programming and applications Class Exercise 7 Today: 3. Linear programming.
3.3 Linear Programming. Vocabulary Constraints: linear inequalities; boundary lines Objective Function: Equation in standard form used to determine the.
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.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 7-1 1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 7 Linear.
1. What does a need to be if there were infinitely many solutions to the system of equations. y + 2x = 12 2y + 4x = 2a.
1 Geometrical solution of Linear Programming Model.
Chapter 3: Sensitivity Analysis and the Dual Problem & Shadow Prices
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Do Now The cost of renting a pool at an aquatic center is either $30 an hr. or $20 an hr. with a $40 non refundable deposit. Use algebra to find for how.
3-3 Linear Programming.
Linear Programming – Introduction
Introduction to Linear Programs
A seminar talk on “SOLVING LINEAR PROGRAMMING PROBLEM BY GRAPHICAL METHOD” By S K Indrajitsingha M.Sc.
Chapter 5 Linear Inequalities and Linear Programming
Operations Management Linear Programming Module B
Linear Programming Wyndor Glass Co. 3 plants 2 new products
Linear Programming Objectives: Set up a Linear Programming Problem
Duality Theory and Sensitivity Analysis
Chapter 8 Goal Programming.
Linear Programming Example: Maximize x + y x and y are called
Case 2:( Model Construction):
Presentation transcript:

1/17: DSCB Getting Started, Linear Programming Administrative Issues –Syllabus –Calendar –Get usernames, addresses, majors Linear Programming Small Groups Homework

Administrative Issues Syllabus: –Available at –Midterm exam: Thursday, February 21, due 2/23 –Final exam: Thursday, April 25, 6:30 – 9:00 p.m. Calendar: –Available at –PowerPoint viewer available at Grade page: –Available at

Administrative Issues Grade page: –Available at –Example at I need from you a sheet of paper with: –Your name (as you like to be called) –Your username for the grade page (don’t be obvious) –Your major, or what major(s) you are considering

Linear Programming What is it? –Synthesizing a problem in words into a series of equations. –A type of modeling tool –Optimizing a linear function subject to several constraints, expressed as inequalities.

LP - 4 Characteristics Objective Function –Something to be minimized or maximized –Usually maximizing profit, sometimes minimizing costs Constraints –Limitations on pursuit of the objective Alternative Courses of Action –Must have more than one possible course of action, or there is no need for LP Linear Equations (or inequalities)

EX: Toy Company A toy company makes 3 types of toys: wooden trucks, wooden dolls, and chess sets. Each requires some amount of hand labor, machine time, and wood. A wooden truck needs 10 min. hand time, 3 min. machine time, and 15 linear inches of wood. A wooden doll requires 8 min. hand time, 10 min. machine time, and 11 linear inches of wood. A chess set takes 3 min. hand time, 20 min. machine time, and 31 linear inches of wood. Per day, there are 8 hours of hand labor time, 8 hours on the machine, and 1000 linear feet of wood available. The profit margins for the truck, doll, and chess set are $7, $5, and $12, respectively.

Toy Company Formulate a linear program set to maximize the company's profit.

Terminology Z : variable to be optimized. x 1, x 2, x 3,… : decision variables. So we write Max Z ( profit ) = (some combo of x 1...x X ) S. T. ("subject to"): (the constraints)

Toy Company What are we supposed to maximize? What factors play a part in that? What constraints are there to the profit?

A toy company makes 3 types of toys: wooden trucks, wooden dolls, and chess sets. Each requires some amount of hand labor, machine time, and wood. A wooden truck needs 10 min. hand time, 3 min. machine time, and 15 linear inches of wood. A wooden doll requires 8 min. hand time, 10 min. machine time, and 11 linear inches of wood. A chess set takes 3 min. hand time, 20 min. machine time, and 31 linear inches of wood. Per day, there are 8 hours of hand labor time, 8 hours on the machine, and 1000 linear feet of wood available. The profit margins for the truck, doll, and chess set are $7, $5, and $12, respectively. Maximize the company’s profit.

A toy company makes 3 types of toys: wooden trucks, wooden dolls, and chess sets. Each requires some amount of hand labor, machine time, and wood. A wooden truck needs 10 min. hand time, 3 min. machine time, and 15 linear inches of wood. A wooden doll requires 8 min. hand time, 10 min. machine time, and 11 linear inches of wood. A chess set takes 3 min. hand time, 20 min. machine time, and 31 linear inches of wood. Per day, there are 8 hours of hand labor time, 8 hours on the machine, and 1000 linear feet of wood available. The profit margins for the truck, doll, and chess set are $7, $5, and $12, respectively. Maximize the company’s profit.

A toy company makes 3 types of toys: wooden trucks, wooden dolls, and chess sets. Each requires some amount of hand labor, machine time, and wood. A wooden truck needs 10 min. hand time, 3 min. machine time, and 15 linear inches of wood. A wooden doll requires 8 min. hand time, 10 min. machine time, and 11 linear inches of wood. A chess set takes 3 min. hand time, 20 min. machine time, and 31 linear inches of wood. Per day, there are 8 hours of hand labor time, 8 hours on the machine, and 1000 linear feet of wood available. The profit margins for the truck, doll, and chess set are $7, $5, and $12, respectively. Maximize the company’s profit.

A toy company makes 3 types of toys: wooden trucks, wooden dolls, and chess sets. Each requires some amount of hand labor, machine time, and wood. A wooden truck needs 10 min. hand time, 3 min. machine time, and 15 linear inches of wood. A wooden doll requires 8 min. hand time, 10 min. machine time, and 11 linear inches of wood. A chess set takes 3 min. hand time, 20 min. machine time, and 31 linear inches of wood. Per day, there are 8 hrs. of hand labor time, 8 hrs. machine time, and 1000 linear feet of wood available. The profit margins for the truck, doll, and chess set are $7, $5, and $12, respectively. Maximize the company’s profit.

Toy Company What are we supposed to maximize? –THE PROFIT What factors play a part in that? –PROFIT FROM TRUCKS, DOLLS, and CHESS SETS What constraints are there to the profit? –HAND TIME, MACHINE TIME, and WOOD

Toy Company Let x 1 = toy trucks, x 2 = dolls, x 3 = chess sets.

Toy Company Let x 1 = toy trucks, w/ a $7 profit each x 2 = dolls, w/ a $5 profit each x 3 = chess sets w/ a $12 profit each

Toy Company Let x 1 = toy trucks, w/ a $7 profit each x 2 = dolls, w/ a $5 profit each x 3 = chess sets w/ a $12 profit each So Max Z (profit) = 7 x x x 3

Toy Company - constraints Hand Time: total of 8 hours. -- or 480 min. Truck - 10 min. Doll - 8 min. Chess Set - 3 min.

Toy Company - constraints Hand Time: total of 8 hours. -- or 480 min. Truck - 10 min. Doll - 8 min. Chess Set - 3 min. so 10 x x x 3 <= 480

Toy Company - constraints Machine Time: total of 8 hrs. -- or 480 min. Truck - 3 min. Doll - 10 min. Chess Set - 20 min.

Toy Company - constraints Machine Time: total of 8 hrs. -- or 480 min. Truck - 3 min. Doll - 10 min. Chess Set - 20 min. so 3 x x x 3 <= 480

Toy Company - constraints Wood: total of 1000 ft. -- or 12,000 in. Truck - 15 in. Doll - 11 in. Chess Set - 31 in.

Toy Company - constraints Wood: total of 1000 ft. -- or 12,000 in. Truck - 15 in. Doll - 11 in. Chess Set - 31 in. so 15 x x x 3 <= 12000

Toy Company - constraints Other constraints: Integers:x 1, x 2, x 3 must be integers. Positive: x 1, x 2, x 3 >= 0

Toy Company - total LP Max Z (profit) = 7 x x x 3 S. T.: 10 x x x 3 <= x x x 3 <= x x x 3 <= x 1, x 2, x 3 >= 0 x 1, x 2, x 3 must be integers.

EX: Camping Trip. PCF $/lb beef jerky dried potatoes granola mix NutriGrain bars Must have 30 g. protein, 60 g. carbohydrates, and 15 g. of fat. Minimize the cost.

Graphical Solutions for LP Sparky Electronics 2 products, WalkFM & WristTV profit: $7 $5 machine time 4 3 assembly time 2 1 Total machine time 240 Total assembly time 100

LP - Graphical Solution Limitation to the method: only TWO decision variables can exist.

LP - Graphical Solution Maximize ? S. T. :? ?

LP - Graphical Solution Maximize Z ( profit ) = 7 x x 2 S. T. :? ?

LP - Graphical Solution Maximize Z ( profit ) = 7 x x 2 S. T. :4 x x 2 <= 240

LP - Graphical Solution Maximize Z ( profit ) = 7 x x 2 S. T. :4 x x 2 <= x x 2 <= 100

LP - Graphical Solution Maximize Z ( profit ) = 7 x x 2 S. T. :4 x x 2 <= x x 2 <= 100 x 1, x 2 >= 0

LP - Graphical Solution 4 x x 2 = x x 2 = 100 x 1. x 2 >= 0

LP - Graphical Solution 4 x x 2 = 240 x1x1 x2x2

LP - Graphical Solution 4 x x 2 = x x 2 = 100 x1x1 x2x2

LP - Graphical Solution 4 x x 2 = x x 2 = 100 Feasible Solution Region x1x1 x2x2

LP - Graphical Solution 4 x x 2 = x x 2 = 100 x1x1 x2x2

LP - Graphical Solution 4 x x 2 = x x 2 = 100 Max Z = 7 x x 2 Z = $400 Z = $410 Z = $350 x1x1 x2x2

LP - Graphical Solution 4 x x 2 = x x 2 = 100 Max Z = 7 x x 2 Z = $400 Z = $410 Z = $350

Small Groups: Kelson Sporting Gds. Kelson Co. makes two types of baseball gloves: a standard model and a catcher’s mitt. There is 900 hours of production time available in the cutting department, 300 hours in finishing, & 100 hours in packaging. Write the LP model for this problem. Use the graphical solution method to find the optimal solution. What is the total profit possible? ModelCuttingFinishingPacking$ profit Regular11/21/8$5 Catcher’s 1 ½ 1/3 ¼ $8

Homework ch. 1 #11, 18 ch. 2 #11, 21 Reminder: should be legible, labeled with your name and the date, and make sense.