Question:- A company assembles four products (1, 2, 3, 4) from delivered components. The profit per unit for each product (1, 2, 3, 4) is £10, £15, £22.

Slides:



Advertisements
Similar presentations
1 Chapter 14 Making the most of things: Linear Programming.
Advertisements

بسم الله الرحمن الرحيم CONTENTS EXERCISES DIET PROBLEM REFERENCES
OPERATIONS RESEARCH LINEAR PROGRAMMING (SOLVED) BY BY APARNA APARNA ASHA.V ASHA.V SARITHA SARITHA JINTO JINTO.
1Introduction to Linear ProgrammingLesson 2 Introduction to Linear Programming.
Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
LINEAR PROGRAMMING SENSITIVITY ANALYSIS
Lesson 08 Linear Programming
Linear Programming We are to learn two topics today: LP formulation
Planning with Linear Programming
Linear Programming Problem
Lesson 11 Multicriteria Decisions within LP Framework.
Chapter 9 Question 2 [Anisha Patel]
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Feb 18, 2013.
Profitability and Risk Management 1 Theory of Constraints Let’s go back to the CVP model: What “constrains” your profit? If you can choose X to be arbitrarily.
Linear Programming Models: Graphical Methods
LINEAR PROGRAMMING (LP)
8/27: Linear Programming Lecture: LP Small Groups Homework.
19 Linear Programming CHAPTER
Linear Programming Introduction George B Dantzig developed LP in It is a problem solving approach designed to help managers/decision makers in planning.
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
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.
B-1 Operations Management Linear Programming Module B.
Eg Al is buying some cows and sheep for his farm. He buys c cows at £120 each He buys s sheep at £200 each. He wants at least 10 animals in total. He wants.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Linear Programming Applications
Linear Programming Example 2 Alternate Optimal Solutions.
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
EXAMPLE: 3.1 ASSEMBLING AND TESTING COMPUTERS
Chapter 12 Section 12.1 The Geometry of Linear Programming.
Integer Programming Models
Ardavan Asef-Vaziri Systems and Operations Management
1 1 Slide Integer Linear Programming Professor Ahmadi.
1 1 Slide Integer Linear Programming Professor Ahmadi.
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
 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.
Linear Programming with Excel Solver.  Use Excel’s Solver as a tool to assist the decision maker in identifying the optimal solution for a business decision.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
Lab 3 Solver Add-In In Excel ► Lab 2 Review ► Solver Add-in Introduction ► Practice Solver following Instructor » Saferly Inc.
Intro to Linear Programming
OSCM 230 Fall 2013 Management Science Lecture 4 Linear Programming II 9/11/2013, 9/16/ Lecture 4 Linear Programming II Professor Dong Washington.
Linear Programming Ex1) Use the system of constraints below to maximize the objective function z = -0.4x + 3.2y. Corner Points.
Integer Programming Definition of Integer Programming If requiring integer values is the only way in which a problem deviates from.
1 A Logistics Problem The Dispatch Manager for ABC Logistics needs to send a fleet of 8 small trucks and 4 large trucks from a depot to pick up items at.
OPSM 301 Operations Management Class 13&14: Linear Programming using Excel Koç University Zeynep Aksin
LINEAR PROGRAMMING.
OPSM 301 Operations Management Class 11: Linear Programming using Excel Koç University Zeynep Aksin
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)
11D Applications of linear programming. There are three types of applications that we look at in Further Maths – Manufacturing problems (Ex 11C) – Blending.
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.
Bonus Problem 1. Decision Models -- Prof. Juran2 Optimization Example: Malcolm’s Glass Shop.
AAT Level 3 Limiting Factors. Objectives 1. Explain what production decisions are required when resources are scarce 2. State the steps to calculate limiting.
MATH143 Lec 7 Quantitative Methods
3.3 and 3.4 Applications of Linear Models
Introduction to Linear Programs
Chapter 5 Linear Inequalities and Linear Programming
Linear Programming Dr. T. T. Kachwala.
Introduction To Linear Programming
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
Linear Programming – A First Example
السيولة والربحية أدوات الرقابة المالية الوظيفة المالية
A Logistics Problem The Dispatch Manager for ABC Logistics needs to send a fleet of 7 small trucks and 4 large trucks from a depot to pick up items at.
Linear Programming Objectives: Set up a Linear Programming Problem
Constraint management
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,
10.8 Linear Programming.
Objectives Compare linear, quadratic, and exponential models.
Linear Programming Mr. Carpenter Alg. 2.
WELCOME By “MATHEMATICAL FORMULATION” Smt. N. Prabhavathi
Simplex Tableau Method
Presentation transcript:

Question:- A company assembles four products (1, 2, 3, 4) from delivered components. The profit per unit for each product (1, 2, 3, 4) is £10, £15, £22 and £17 respectively. The maximum demand in the next week for each product (1, 2, 3, 4) is 50, 60, 85 and 70 units respectively. There are three stages (A, B, C) in the manual assembly of each product and the man-hours needed for each stage per unit of product are shown below Stages Products 1 2 3 4 A 2 2 1 1 B 2 4 1 2 C 3 6 1 5 The nominal time available in the next week for assembly at each stage (A, B, C) is 160, 200 and 80 man-hours respectively. It is possible to vary the man-hours spent on assembly at each stage such that workers previously employed on stage B assembly could spend up to 20% of their time on stage A assembly and workers previously employed on stage C assembly could spend up to 30% of their time on stage A assembly. Production constraints also require that the ratio (product 1 units assembled)/(product 4 units assembled) must lie between 0.9 and 1.15. Formulate the problem of deciding how much to produce next week as a linear program.

Decision Variables:- Objective:- Maximize profit for the week x1=amount of product 1 produced x2= amount of product 2 produced x3= amount of product 3 produced x4= amount of product 4 produced Tba = amount of time transferred from B to A Tca = amount of time transferred from C to A Objective:- Maximize profit for the week Z= 10 x1+ 15x2+ 22x3+ 17x4

Constraints:- Maximum demand for each product x1<=50 x2<=60 Ratio of amount of x1 assembled to the amount of x4 assembled 0.9<=(x1/x4)<=1.15 i.e. 0.9x4<=x1 & x1<= 1.15x4 Limit on transfer of man hours Tba<=0.2(200) Tca<=0.3(80)

Contd…… Work time available during the week for each stage 2x1+2x2+x3+x4 <= 160+Tba+Tca------------- Stage A 2x1+4x2+x3+2x4<= 200-Tba------------------ Stage B 3x1+6x2+x3+5x4<= 80-Tca-------------------- Stage C All variables used x1,x2,x3,x4, Tba,Tca >= 0