HW #1 3.1-11 3.4-6 3.4-14 Due: 2004-10-11.

Slides:



Advertisements
Similar presentations
Linear Programming Problem. Introduction Linear Programming was developed by George B Dantzing in 1947 for solving military logistic operations.
Advertisements

Manufacturing Microwaves A company produces both small and large microwave ovens. Machine time: 4 hours for small ovens and 3 hours for large ones. A total.
Planning with Linear Programming
Linear Programming Problem
Lesson 11 Multicriteria Decisions within LP Framework.
Assignment (6) Simplex Method for solving LP problems with two variables.
Session II – Introduction to Linear Programming
1/53 Slide Linear Programming: Sensitivity Analysis and Interpretation of Solution n Introduction to Sensitivity Analysis n Graphical Sensitivity Analysis.
LINEAR PROGRAMMING (LP)
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Linear Programming: Formulations & Graphical Solution.
© 2008 Prentice-Hall, Inc. Chapter 7 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Linear Programming Introduction George B Dantzig developed LP in It is a problem solving approach designed to help managers/decision makers in planning.
Strategic Allocation of Resources
Basic Linear Programming Concepts Lecture 2 (4/1/2015)
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.
EMGT 501 HW # Due Day: Sep 14.
EMGT 501 HW # Due Day: Sep 12.
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
Linear Goal Programming
1 1 Slide Chapter 14: Goal Programming Goal programming is used to solve linear programs with multiple objectives, with each objective viewed as a "goal".
Environmentally Conscious Design & Manufacturing (ME592) Date: May 3, 2000 Slide:1 Environmentally Conscious Design & Manufacturing Class 24: Optimization.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
QM B Lego Simplex. Scenario You manufacture tables and chairs. Tables and chairs are manufactured from small and large bricks. Small brick Large brick.
Chapter 4 Simplex Method for Linear Programming Shi-Shang Jang Chemical Engineering Department National Tsing-Hua University.
Chapter 10. Resource Allocation
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
Goals and aims To introduce Linear Programming To find a knowledge on graphical solution for LP problems To solve linear programming problems using excel.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Product Mix Problem Monet company makes four types of frames.
Ardavan Asef-Vaziri Systems and Operations Management
Decision Making via Linear Programming: A simple introduction Fred Phillips
Optimization Models Mathematical optimization models usually contain an objective (what to do) constraints (the rules that must be followed). Also referred.
Product Mix & Master Production Scheduling
Chapter 6 Supplement Linear Programming.
Opener. Notes: 3.4 Linear Programming Optimization  Many real-life problems involve a process called optimization.  This means finding a maximum or.
Linear Programming: A Geometric Approach3 Graphing Systems of Linear Inequalities in Two Variables Linear Programming Problems Graphical Solution of Linear.
Resource Allocation Class 7: 3/9/ W HY N ETWORK P LANNING ? Find the right balance between inventory, transportation and manufacturing costs, Match.
Examples discussed in class
1 Systems Analysis Methods Dr. Jerrell T. Stracener, SAE Fellow SMU EMIS 5300/7300 NTU SY-521-N NTU SY-521-N SMU EMIS 5300/7300 Statistical Analysis Other.
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.
LINEAR PROGRAMMING.
Ch. 3 Notes Page 19 P19 3.4b: Linear Programming.
Copyright © Cengage Learning. All rights reserved. 3 LINEAR PROGRAMMING: A GEOMETRIC APPROACH.
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
© 2008 Prentice-Hall, Inc. Linear Programming Models: Graphical and Computer Methods.
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 (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
Linear Programming. George Dantzig 1947 NarendraKarmarkar Pioneers of LP.
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.
Introduction Operations Research (OR) It is a scientific approach to determine the optimum (best) solution to a decision problem under the restriction.
Cairo University Institute of Statistical Studies and Research - ISSR
GOOD MORNING CLASS! In Operation Research Class, WE MEET AGAIN WITH A TOPIC OF :
Linear Programming.
MBA, Semester 2 Operations Management Ms. Aarti Mehta Sharma
MID-TERM EXAM/REVISION
3.3 and 3.4 Applications of Linear Models
Introduction to Linear Programs
CHAPTER 6:LINEAR PROGRAMMING
Linear Programming Dr. T. T. Kachwala.
MBA 651 Quantitative Methods for Decision Making
Linear Programming Objectives: Set up a Linear Programming Problem
Basic Linear Programming Concepts
Chapter 8 Goal Programming.
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,
Linear Programming Mr. Carpenter Alg. 2.
Linear Programming.
Presentation transcript:

HW #1 3.1-11 3.4-6 3.4-14 Due: 2004-10-11

(Machine Hours per Week) 3.1-11 The Omega Manufacturing Manufacturing Company has discontinued the production of a certain unprofitable product line. This act created considerable excess production capacity. Management is considering devoting this excess capacity to one ore more of three products; call them products 1, 2, and 3. The available capacity on the machines that might limit output is summarized in the following table: Available Time (Machine Hours per Week) 500 350 150 Machine Type Milling machine Lathe Grinder

The number of machine hours required for each unit of the respective products is Productivity coefficient (in machine hours per unit) Machine Type Milling machine Lathe Grinder Product 1 9 5 3 Product 2 3 4 Product 3 5 2 The sales department indicates that the sales potential for products 1 and 2 exceeds the maximum production rate and that the sales potential for product 3 is 20 units per week. The unit profit would be $50, $20, and $25, respectively, on products 1, 2, and 3. The objective is to determine how much of each product Omega should produce to maximize profit. (a) Formulate a linear programming model for this problem. (b) Use a computer to solve this model by the simplex method.

3.4-6 Consider the following LP problem:

Use the graphical method to solve the problem How does the optimal solution change if the objective function is changed to ? How does the optimal solution change if the third constraint is changed to

3.4-14 The Metalco company desires to blend a new alloy of 40% tin, 35% zinc, and 25% lead from several available alloys having the following properties. Alloy 1 2 3 4 5 60 25 45 20 50 10 15 45 50 40 30 60 10 30 10 Property % of tin % of zinc % of lead Cost ($/lb) 22 20 25 24 27

The objective is to determine the proportions of these alloys that should be blended to produce the new alloy at a minimum cost. (a) Formulate a linear programming model for this problem. (b) Use a computer to solve this model by the simplex method.