Case 2:( Model Construction):

Slides:



Advertisements
Similar presentations
Optimization problems using excel solver
Advertisements

1Introduction to Linear ProgrammingLesson 2 Introduction to Linear Programming.
LINEAR PROGRAMMING (LP)
Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
1 1 Slide © 2005 Thomson/South-Western Slides Prepared by JOHN S. LOUCKS ST. EDWARD’S UNIVERSITY.
Planning with Linear Programming
Linear Programming Problem
Linear Programming (LP) Decision Variables Objective (MIN or MAX) Constraints Graphical Solution.
Linear Programming Models & Case Studies
LINEAR PROGRAMMING (LP)
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.
8/27: Linear Programming Lecture: LP Small Groups Homework.
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
© 2008 Prentice-Hall, Inc. Chapter 7 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created.
Environmentally Conscious Design & Manufacturing (ME592) Date: May 3, 2000 Slide:1 Environmentally Conscious Design & Manufacturing Class 24: Optimization.
QM B Lego Simplex. Scenario You manufacture tables and chairs. Tables and chairs are manufactured from small and large bricks. Small brick Large brick.
Linear Programming Example 2 Alternate Optimal Solutions.
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
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.
On LT simulation Game ends at 8:45 p.m.
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.
 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.
Business Mathematics Rétallér Orsi.
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.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
Introduction to linear programming:- - Linear programming (LP) applies to optimization models in which the objective and constraints functions are strictly.
Optimization unconstrained and constrained Calculus part II.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Linear Programming-Bellwork
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 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Don Sutton Spring LP Basic Properties Objective Function – maximize/minimize profit/cost Resource Constraints – labor, money Decision.
Introduction Operations Research (OR) It is a scientific approach to determine the optimum (best) solution to a decision problem under the restriction.
1 Introduction To Linear Programming l Today many of the resources needed as inputs to operations are in limited supply. l Operations managers must understand.
0 Integer Programming Introduction to Integer Programming (IP) Difficulties of LP relaxation IP Formulations Branch and Bound Algorithms Reference: Chapter.
Excel Solver Tutorial BI&A 674.
Class 10: Introduction to Linear Programming
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Linear Programming Models: Graphical and Computer Methods
MID-TERM EXAM/REVISION
2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.
3-3 Linear Programming.
Chapter 5 Linear Inequalities and Linear Programming
Lesson 4-3 System of Inequalities
Introduction To Linear Programming
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
MBA 651 Quantitative Methods for Decision Making
Presentation by Team 2.
Linear Programming Objectives: Set up a Linear Programming Problem
Duality Theory and Sensitivity Analysis
LINGO TUTORIAL 2.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Chapter 8 Goal Programming.
Linear Programming Introduction.
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Widgets Problem Suppose a company produces two types of widgets, manual and electric. Each requires in its manufacture the use of three machines; A, B,
Chapter 4 The Simplex Algorithm
Nature does nothing uselessly.
Linear Programming Introduction.
10.8 Linear Programming.
Introduction to Linear Programming
Linear Programming: Model Formulation and Graphic Solution
Presentation transcript:

Case 2:( Model Construction): Operation Research Case 2:( Model Construction): Montana Wood Products manufactures two-high quality products, tables and chairs. Its profit is $15 per chair and $21 per table. Weekly production is constrained by available labor and wood. Each chair requires 4 labor hours and 8 board feet wood while each table requires 3 labor hours and 12 board feet of wood. Available wood is 2400 board feet and available labor is 920 hours. Management also requires at least 40 tables and at least 4 chairs be produced for every table produced. Required: Prepare the mathematical model for the problem .

You can collect the previous data in this table Chair Table Maximum Solution: You can collect the previous data in this table Chair Table Maximum availability Labor 4 3 920 Wood 8 12 2400 Profit per unit 15 21 1. Determining the decision variables: X1 = number of chairs produced weekly X2 = number of tables produced weekly 2-Define the objective Maximize total weekly profit 3. Construction the objective function Max. Z = 15 X1 + 21 X2

Construction the restrictions: Constraint of Labor hours 4 X1+ 3 X2 ≤ 920 Constraint of bored feet 8 X1 + 12 X2≤ 2400 At least 40 tables X2 ≥ 40 At least 4 chairs for every table X1 ≥ 4 x2 The non-negatively restrictions: X1 , X2 ≥ 0

Final Form Max z = 15 X1 + 21 X2 Subject To: 4x1 + 3x2 ≤ 920 (labor constraint) 8x1 +12x2 ≤ 2400 (wood constraint) X2 ≥ 40 (make at least 40 tables) X1 ≥ 4 x2 (at least 4 chairs per table) X1 ≥ 0 (non – negatively) X2 ≥ 0 (non – negatively)

Case 3: (Model Construction): El Naser Concrete Company produces concrete. Two elements in concrete are sand (costs $6 per ton) and gravel (costs $8 per ton). Sand and gravel together must make up exactly 75% of the weight of the concrete. Also, no more than 40% of the concrete can be sand and at least 30% of the concrete be gravel. Each day 2000 tons of concrete are produced. To minimize costs, how many tons of gravel and sand should be purchased each day? Required: Prepare the mathematical model for the problem . Solution: Define the objective Minimize daily costs Determining the decision variables:

Construction the objective function: Min z = 6 X1 + 8 X2 X1 = tons of sand purchased X2 = tons of gravel purchased Construction the objective function: Min z = 6 X1 + 8 X2 Construction the restrictions: 75% must be sand and gravel (X1 + X2 = 1500) No more than 40% must be sand (X1 ≤ 800) At least 30% must be gravel( X2 ≥ 600) The non-negatively restrictions: X1 , X2 ≥ 0 Final Form Min z = 6x1 + 8 X2 Subject To: X1 + X2 = 1500 (mix constraint) X1 ≤ 800 (mix constraint) X2 ≥ 600 (mix constraint) X1 , X2 ≥ 0 (non-negatively constraints)