Applications of Linear Programming

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

Finance 30210: Managerial Economics Optimization.
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.
1Introduction to Linear ProgrammingLesson 2 Introduction to Linear Programming.
Chapter 19 – Linear Programming
Linear Programming Problem. Introduction Linear Programming was developed by George B Dantzing in 1947 for solving military logistic operations.
Lesson 08 Linear Programming
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Linear Programming.
Linear Programming Problem
Linear Programming (LP) Decision Variables Objective (MIN or MAX) Constraints Graphical Solution.
1 © 2010 Pearson Education, Inc. All rights reserved © 2010 Pearson Education, Inc. All rights reserved Chapter 8 Systems of Equations and Inequalities.
19 Linear Programming CHAPTER
Finance 30210: Managerial Economics Optimization.
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
Linear and Integer Programming Models
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
REVIEW OF INEQUALITIES August 25 th, Review of Symbols Less Than: ____________Greater Than: _______________ Less Than or Equal To: _________Greater.
Linear-Programming Applications
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
Chapter 19 Linear Programming McGraw-Hill/Irwin
Linear Programming Chapter 13 Supplement.
STDM - Linear Programming 1 By Isuru Manawadu B.Sc in Accounting Sp. (USJP), ACA, AFM
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
Objective Vocabulary Solve linear programming problems.
Introduction to Linear Programming BSAD 141 Dave Novak.
Opener. Notes: 3.4 Linear Programming Optimization  Many real-life problems involve a process called optimization.  This means finding a maximum or.
A – 1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Strategic Allocation of Resources (Linear Programming) E For Operations Management,
PowerPoint Slides by Robert F. BrookerHarcourt, Inc. items and derived items copyright © 2001 by Harcourt, Inc. Managerial Economics in a Global Economy.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
Introduction to linear programming:- - Linear programming (LP) applies to optimization models in which the objective and constraints functions are strictly.
1 A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear constraints. The linear model consists of the.
Optimization unconstrained and constrained Calculus part II.
Part 3 Linear Programming 3.3 Theoretical Analysis.
Linear Programming –Strategic Allocation of Resources Decision Making with Excel Simulation 1.
EVERYONE NEEDS TO COPY THESE DOWN! Continue on same warm up page. 1.Convert 100 mph to feet per second (5280 ft = 1 mile) 2.John rode 2 kilometers on his.
Calculus-Based Optimization AGEC 317 Economic Analysis for Agribusiness and Management.
Application to economics Consumer choice Profit maximisation.
Linear Programming Department of Business Administration FALL by Asst. Prof. Sami Fethi.
Section 3-4 Objective: To solve certain applied problems using linear programming. Linear Programming.
LINEAR PROGRAMMING MEANING:
1 What you will learn  Lots of vocabulary!  How to find the maximum and minimum value of a function given a set of “rules”
Linear Programming. George Dantzig 1947 NarendraKarmarkar Pioneers of LP.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
1 Linear Programming 2 A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear constraints. The linear.
Excel’s Solver Use Excel’s Solver as a tool to assist the decision maker in identifying the optimal solution for a business decision. Business decisions.
Class 10: Introduction to Linear Programming
Linear Programming.
Linear Programming – Introduction
Systems of Inequalities
Economics, Markets and Organizations (Tutorial 3)
Chapter 19 – Linear Programming
Linear Programming Dr. T. T. Kachwala.
Linear Programming Wyndor Glass Co. 3 plants 2 new products
and Graphing Inequalities
Algebra 2 Ch.3 Notes Page 20 P Linear Programming (Part 2)
Part 3 Linear Programming
Objective Vocabulary Solve linear programming problems.
7 The Production Process: The Behavior of Profit-Maximizing Firms
Factor as many polynomials as you can.
Factor as many polynomials as you can.
Constraint management
Linear Programming Introduction.
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Linear Programming Introduction.
10.8 Linear Programming.
Calculus-Based Optimization AGEC 317
7 The Production Process: The Behavior of Profit-Maximizing Firms
Linear Programming.
Presentation transcript:

Applications of Linear Programming Finite 3-3

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. Applications

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 Applications

Linearity Applications Constant prices for outputs (as in a perfectly competitive market). 2. Constant returns to scale for production processes. Typically, each decision variable also has a non-negativity constraint. For example, the time spent using a machine cannot be negative. Applications

The B & W Leather Company wants to add handmade belts and wallets to its product line. Each belt nets the company $18 in profit, and each wallet nets $12. Both belts and wallets require cutting and sewing. Belts require 2 hours of cutting time and 6 hours of sewing time. Wallets require 3 hours of cutting time and 3 hours of sewing time. If the cutting machine is available 12 hours a week and the sewing machine is available 18 hours per week, what ratio of belts and wallets will produce the most profit within the constraints? Example

The B & W Leather Company wants to add handmade belts and wallets to its product line. Each belt nets the company $18 in profit, and each wallet nets $12. Both belts and wallets require cutting and sewing. Belts require 2 hours of cutting time and 6 hours of sewing time. Wallets require 3 hours of cutting time and 3 hours of sewing time. If the cutting machine is available 12 hours a week and the sewing machine is available 18 hours per week, what ratio of belts and wallets will produce the most profit within the constraints? Example

Example

Toys-A-Go makes toys at Plant A and Plant B Toys-A-Go makes toys at Plant A and Plant B. Plant A needs to make a minimum of 1000 toy dump trucks and fire engines. Plant B needs to make a minimum of 800 toy dump trucks and fire engines. Plant A can make 10 toy dump trucks and 5 toy fire engines per hour. Plant B can produce 5 toy dump trucks and 15 toy fire engines per hour. It costs $30 per hour to produce toy dump trucks and $35 per hour to operate produce toy fire engines. How many hours should be spent on each toy in order to minimize cost? What is the minimum cost? Practice

Toys-A-Go makes toys at Plant A and Plant B Toys-A-Go makes toys at Plant A and Plant B. Plant A needs to make a minimum of 1000 toy dump trucks and fire engines. Plant B needs to make a minimum of 800 toy dump trucks and fire engines. Plant A can make 10 toy dump trucks and 5 toy fire engines per hour. Plant B can produce 5 toy dump trucks and 15 toy fire engines per hour. It costs $30 per hour to produce toy dump trucks and $35 per hour to operate produce toy fire engines. How many hours should be spent on each toy in order to minimize cost? What is the minimum cost? Practice

Practice

A diet is to include at least 140 milligrams of Vitamin A and at least 145 milligrams of Vitamin B. These requirements can be obtained from two types of food. Type X contains 10 milligrams of Vitamin A and 20 milligrams of Vitamin B per pound. Type Y contains 30 milligrams of Vitamin A and 15 milligrams of Vitamin B per pound. If type X food costs $12 per pound and type Y food costs $8 per pound how many pounds of each type of food should be purchased to satisfy the requirements at the minimum cost? Practice

A diet is to include at least 140 milligrams of Vitamin A and at least 145 milligrams of Vitamin B. These requirements can be obtained from two types of food. Type X contains 10 milligrams of Vitamin A and 20 milligrams of Vitamin B per pound. Type Y contains 30 milligrams of Vitamin A and 15 milligrams of Vitamin B per pound. If type X food costs $12 per pound and type Y food costs $8 per pound how many pounds of each type of food should be purchased to satisfy the requirements at the minimum cost? Practice

Practice

Pages 131 – 136 7, 11, 17, 23 Homework