Linear-Programming Applications

Slides:



Advertisements
Similar presentations
PowerPoint Slides by Robert F. BrookerCopyright (c) 2001 by Harcourt, Inc. All rights reserved. Linear Programming Mathematical Technique for Solving Constrained.
Advertisements

Max output (Q) subject to a cost constraint
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.
Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
Linear Programming Problem. Introduction Linear Programming was developed by George B Dantzing in 1947 for solving military logistic operations.
Linear Programming.
Linear Programming Problem
Chapter 2: Modeling with Linear Programming & sensitivity analysis
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc
Linear and Integer Programming Models
Linear Programming?!?! Sec Linear Programming In management science, it is often required to maximize or minimize a linear function called an objective.
Chapter 6 Linear Programming: The Simplex Method
19 Linear Programming CHAPTER
Operation Research Chapter 3 Simplex Method.
Finance 30210: Managerial Economics Optimization.
Introduction to Management Science
Finance 510: Microeconomic Analysis
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
Linear and Integer Programming Models
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
6s-1Linear Programming CHAPTER 6s Linear Programming.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
THE MATHEMATICS OF OPTIMIZATION
Linear Programming.
Applied Economics for Business Management
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Chapter 19 Linear Programming McGraw-Hill/Irwin
Linear Programming Chapter 13 Supplement.
Chapter 6 Production. ©2005 Pearson Education, Inc. Chapter 62 Topics to be Discussed The Technology of Production Production with One Variable Input.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.
STDM - Linear Programming 1 By Isuru Manawadu B.Sc in Accounting Sp. (USJP), ACA, AFM
Linear and Integer Programming Models 1 Chapter 2.
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.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
Chapter 6 Supplement Linear Programming.
1 Linear Programming Chapter 2 By Mohammad Shahid Khan M.Eco, MBA, B.Cs, B.Ed. Lecturer in Economics & Business Administration Department of Economics.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
PowerPoint Slides by Robert F. BrookerHarcourt, Inc. items and derived items copyright © 2001 by Harcourt, Inc. Managerial Economics in a Global Economy.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
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.
Slide 1  2002 South-Western Publishing Web Chapter A Optimization Techniques Overview Unconstrained & Constrained Optimization Calculus of one variable.
1 The Geometry of Linear Programs –the geometry of LPs illustrated on GTC Handouts: Lecture Notes February 5, 2002.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
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.
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Calculus-Based Optimization AGEC 317 Economic Analysis for Agribusiness and Management.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
Adeyl Khan, Faculty, BBA, NSU 1 Introduction to Linear Programming  A Linear Programming model seeks to maximize or minimize a linear function, subject.
Linear Programming Department of Business Administration FALL by Asst. Prof. Sami Fethi.
LINEAR PROGRAMMING MEANING:
Linear Programming. George Dantzig 1947 NarendraKarmarkar Pioneers of LP.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Supply Chain Management By Dr. Asif Mahmood Chapter 9: Aggregate Planning.
Linear Programming for Solving the DSS Problems
Linear Programming.
Chapter 6 Production.
Micro Economics in a Global Economy
Linear Programming Dr. T. T. Kachwala.
Applications of Linear Programming
Exam 1 Review/Instructions
Managerial Economics in a Global Economy
The Simplex Method: Standard Minimization Problems
Linear Programming Introduction.
Linear Programming Introduction.
Linear Programming.
Presentation transcript:

Linear-Programming Applications

Linear-Programming Applications Constrained Optimization problems occur frequently in economics: maximizing output from a given budget; or minimizing cost of a set of required outputs. Lagrangian multiplier problems required binding constraints. A number of business problems have inequality constraints.

Profit Maximization Problem 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 A "linear" programming problem assumes a linear objective function, and a series of linear inequality constraints

Linearity implies: 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.

Solution Methods Linear programming problems can be solved using graphical techniques, SIMPLEX algorithms using matrices, or using software, such as ForeProfit software. 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.

The corner point that maximize 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.

GRAPHICAL Corner Points A, B, and C X1 CONSTRAINT # 1 A B Feasible Region OABC CONSTRAINT # 2 C O X2

Highest Profit Line B GRAPHICAL X1 CONSTRAINT # 1 Optimal Feasible Solution at Point B A B CONSTRAINT # 2 C O X2

The Dual Problem Each linear programming problem (the primal problem) has an associated dual problem. EXAMPLE: A maximization of profit objective function, subject to resource constraints has an associated dual problem The dual is a minimization of the total costs of the resources subject to constraints that the value of the resources used in producing one unit of each output be at least as great as the profit received from the sale of that output.

Duality Theorem THEOREM: the maximum value of the primal (profit max problem) equals the minimum value of the dual (cost minimization) problem. The resource constraints of the primal problem appear in the objective function of the dual problem

Primal: Maximize p = P1·Q1 + P2·Q2 subject to: c·Q1 + d·Q2 < R1 The budget constraint, for example. e·Q1 + f·Q2 < R2 The machine scheduling time constraint. where Q1 and Q2 > 0 Nonnegativity constraint.

Dual: Minimize C = R1·w1 + R2·w2 subject to: c·W1 + e·W2 > P1 Profit Contribution of Product 1 d·W1 + f·W2 > P2 Profit Contribution of Product 2 where W1 and W2 > 0 Nonnegativity constraint.

Complexity and the Method of Solution The solutions to primal and dual problems may be solved graphically, so long as this involves two dimensions. With many products, the solution involves the SIMPLEX algorithm, or software available in FOREPROFIT

Cost Minimization Problem Using Linear Programming Multi-plant firms want to produce with the lowest cost across their disparate facilities. Sometimes, the relative efficiencies of the different plants can be exploited to reduce costs. A firm may have two mines that produces different qualities of ore. The firm has output requirements in each ore quality. Scheduling of hours per week in each mine has the objective of minimizing cost, but achieving the required outputs.

If one mine is more efficient in all categories of ore, and is less costly to operate, the optimal solution may involve shutting one mine down. The dual of this problem involves the shadow prices of the ore constraints. It tells the implicit value of each quality of ore.

Capital Rationing Problem Financial decisions sometimes may be viewed as a linear programming problem. EXAMPLE: A financial officer may want to maximize the return on investments available, given a limited amount of money to invest. The usual problem in finance is to accept all projects with positive net present values, but sometimes the capital budgets are fixed or limited to create "capital rationing" among projects.

The solution involves determining what fraction of money allotted should be invested in each of the possible projects or investments. In some problems, projects cannot be broken into small parts. When this is the case, integer programming can be added to the problem.