We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byKailee Tubb
Modified over 2 years ago
1 © 2006 by Nelson, a division of Thomson Canada Limited Slides developed by: William Rentz & Al Kahl University of Ottawa Web Appendix 4A Production Decisions and Linear Programming
2 © 2006 by Nelson, a division of Thomson Canada Limited Manufacturers have alternative production processes, some using mostly labour, others using machinery more intensively. The objective is to maximize output from these production processes, given constraints on the inputs available, such as plant capacity or union labour contract constraints. A number of business problems have inequality constraints, as in a machine cannot work more than 24 hours in a day. Linear programming works for these types of constraints Production Decisions and Linear Programming
3 © 2006 by Nelson, a division of Thomson Canada Limited Using Linear Programming Constraints of production capacity, time, money, raw materials, budget, space, and other restrictions on choices. These constraints can be viewed as inequality constraints, or. A linear programming problem assumes a linear objective function, and a series of linear inequality constraints
4 © 2006 by Nelson, a division of Thomson Canada Limited 1. Constant prices for outputs (as in a perfectly competitive market). 2.Constant returns to scale for production processes. 3.Typically, each decision variable also has a non-negativity constraint. For example, the time spent using a machine cannot be negative. Linearity Implies:
5 © 2006 by Nelson, a division of Thomson Canada Limited Linear programming problems can be solved using graphical techniques, SIMPLEX algorithms using matrices, or using software, such as Lindo*. In the graphical technique, each inequality constraint is graphed as an equality constraint. The Feasible Solution Space is the area which satisfies all of the inequality constraints. The Optimal Feasible Solution occurs along the boundary of the Feasible Solution Space, at the extreme points or corner points. *www.lindo.com Solution Methods
6 © 2006 by Nelson, a division of Thomson Canada Limited The corner point that maximizes the objective function is the Optimal Feasible Solution. There may be several optimal solutions. Examination of the slope of the objective function and the slopes of the constraints is useful in determining which is the optimal corner point. One or more of the constraints may be slack, which means it is not binding. Each constraint has an implicit price, the shadow price of the constraint. If a constraint is slack, its shadow price is zero. Each shadow price has much the same meaning as a Lagrangian multiplier.
7 © 2006 by Nelson, a division of Thomson Canada Limited TWO DIMENSIONAL LINEAR PROGRAMMING X1X1 X2X2 A B C CONSTRAINT # 1 CONSTRAINT # 2 Corner Points A, B, and C Feasible Region Is OABC O
8 © 2006 by Nelson, a division of Thomson Canada Limited X1X1 X2X2 A B C CONSTRAINT # 1 CONSTRAINT # 2 Optimal Feasible Solution at Point B Greatest Output O
9 © 2006 by Nelson, a division of Thomson Canada Limited Each ray is a different production process (a combination of labour & capital) P1 requires 1 hour of capital and 4 hours of labour P2 requires 2 hours of capital and 2 hours of work P3 requires 5 hours of capital and 1 hour of work Combinations of labour and capital produce lamps: Q 1 + Q 2 + Q 3 The shaded box is the constraint on time for L and K K L P1 P2 P3 8 5 B labour Process Rays
10 © 2006 by Nelson, a division of Thomson Canada Limited There are 3 types of lamps produced each day. There are but 8 hours of labour available a day and There are only 5 hours of capital machine hours. Maximize Q 1 + Q 2 + Q 3 subject to: Q 1 + 2·Q 2 + 5Q 3 < The capital constraint of 5 hours per day. 4Q 1 + 2·Q 2 + Q 3 < The labour constraint of 8 hours per day. where Q 1, Q 2 and Q 3 > 0Nonnegativity constraint. Maximization Problem
11 © 2006 by Nelson, a division of Thomson Canada Limited If all inputs were used in making process 1, which takes 4 hours of labour and 1 hour of machine time, wed make 2 lamps, but have slack machine time. This is feasible, but NOT optimal. At point B on Slide 9, all inputs are used. It involves some of Process 1 and some of Process 2. Using the two rays, Point B can be reached by creating a parallelogram of the two rays. Feasible Region
12 © 2006 by Nelson, a division of Thomson Canada Limited A Parallelogram of Process Rays Using 4 hours of labour and 1 hour of capital makes 1 lamp using process P1 Using the remaining 4 hours of labour and 4 hours of machine time makes 2 lamps using process P2. Solution: 3 lamps (one of type 1 and 2 of type 2) K L P1 P2 P3 8 5 B
13 © 2006 by Nelson, a division of Thomson Canada Limited The solutions to linear programming problems may be solved graphically, so long as this involves two dimensions. With many products, the solution involves the Simplex algorithm. Complexity and the Method of Solution
Slide 1 Maximization of Production Output Subject to a Cost Constraint Appendix 7A Max output (Q) subject to a cost constraint. Let C K be the cost of.
Linear-Programming Applications. Constrained Optimization problems occur frequently in economics: »maximizing output from a given budget; »or minimizing.
STDM - Linear Programming 1 By Isuru Manawadu B.Sc in Accounting Sp. (USJP), ACA, AFM
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
6s-1Linear Programming CHAPTER 6s Linear Programming.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
CHAPTER 19 Linear Programming McGraw-Hill/Irwin Operations Management, Eighth Edition, by William J. Stevenson Copyright © 2005 by The McGraw-Hill Companies,
Linear Programming. George Dantzig 1947 NarendraKarmarkar Pioneers of LP.
1 Linear Programming 2 Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear programming results:
MIT and James Orlin © The Geometry of Linear Programs –the geometry of LPs illustrated on GTC.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
1 The Geometry of Linear Programs –the geometry of LPs illustrated on GTC Handouts: Lecture Notes February 5, 2002.
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
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.
A linear program in which all the variables are non-negative and all the constraints are equalities is said to be in standard form (or augmented.
Linear Programming Department of Business Administration FALL by Asst. Prof. Sami Fethi.
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
PowerPoint Slides by Robert F. BrookerCopyright (c) 2001 by Harcourt, Inc. All rights reserved. Linear Programming Mathematical Technique for Solving Constrained.
1 Linear and Integer Programming Models Chapter 2.
3 Components for a Spreadsheet Optimization Problem There is one cell which can be identified as the Target or Set Cell, the single objective of the.
Linear Programming Problem Prepared by Sayed Mohibul Hossen Lecturer in Statistics.
Linear Programming Chapter 13 Supplement. Pottery Example Beaver Creek Pottery Company is located on a Native American reservation. Each day, the company.
Linear Programming - Standard Form Maximize (Minimize): Subject to:
Linear Programming Econ Outline Review the basic concepts of Linear Programming Illustrate some problems which can be solved by linear programming.
Mjdah Al Shehri Hamdy A. Taha, Operations Research: An introduction, 8 th Edition Chapter 2: Modeling with Linear Programming & sensitivity analysis 1.
Systems of Inequalities in Two Variables Sec. 7.5a.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
Linear and Integer Programming Models 1 Chapter 2.
Chapter 6 Linear Programming: The Simplex Method Section 1 A Geometric Introduction to the Simplex Method.
Opener. Notes: 3.4 Linear Programming Optimization Many real-life problems involve a process called optimization. This means finding a maximum or.
Chapter 2 Linear Programming Models: Graphical and Computer Methods.
1 DSCI 3023 Linear Programming Developed by Dantzig in the late 1940’s A mathematical method of allocating scarce resources to achieve a single objective.
PowerPoint Slides by Robert F. BrookerHarcourt, Inc. items and derived items copyright © 2001 by Harcourt, Inc. Managerial Economics in a Global Economy.
OM2-1Linear Programming Chapter 6 Supplement Linear Programming.
Chapter 5 Sensitivity Analysis: An Applied Approach to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright.
Adeyl Khan, Faculty, BBA, NSU 1 Introduction to Linear Programming A Linear Programming model seeks to maximize or minimize a linear function, subject.
Lecture 10 Dr. Arshad Zaheer LINEAR PROGRAMMING (LP)
5.6 Maximization and Minimization with Mixed Problem Constraints.
Linear Programming?!?! Sec Linear Programming In management science, it is often required to maximize or minimize a linear function called an objective.
1Introduction to Linear ProgrammingLesson 2 Introduction to Linear Programming.
LINEAR PROGRAMMING SIMPLEX METHOD. Introduction With only two decision variables it is possible to use graphical methods to solve LP problems But.
1 1 © 2003 Thomson /South-Western Slide Chapter 3 An Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization.
Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
BUAD306 Chapter 19 – Linear Programming. Optimization QUESTION: Have you ever been limited to what you can get done because you don’t have enough ________?
© 2017 SlidePlayer.com Inc. All rights reserved.