CHAPTER 6:LINEAR PROGRAMMING

Slides:



Advertisements
Similar presentations
1Introduction to Linear ProgrammingLesson 2 Introduction to Linear Programming.
Advertisements

Planning with Linear Programming
Linear Programming Problem
Linear Programming (LP) Decision Variables Objective (MIN or MAX) Constraints Graphical Solution.
Standard  MM3A6. Students will solve linear programming problems in two variables.  a. Solve systems of inequalities in two variables, showing the solutions.
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
Chapter 7 Introduction to Linear Programming. Linear? To get a feel for what linear means let’s think about a simple example. You have $10 to spend and.
Chapter 5 Linear Inequalities and Linear Programming
5.2 Linear Programming in two dimensions: a geometric approach In this section, we will explore applications which utilize the graph of a system of linear.
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ Linear Programming in two dimensions:
LINEAR PROGRAMMING (LP)
Linear Programming Pre-Calc Section 3.4 Running a profitable business requires a careful balancing of resources (for example, peoples’ time, materials,
© 2008 Prentice-Hall, Inc. Chapter 7 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created.
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.
Models for Simulation & Optimization – An Introduction Yale Braunstein.
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
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.
D1: Linear Programming.
Linear Programming Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Linear programming is a strategy for finding the.
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
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 12 Section 12.1 The Geometry of Linear Programming.
CHAPTER 8: POST OPTIMALITY ANALYSIS. What is Post Optimality Analysis?  Post Optimality Analysis –Sensitivity Analysis –What-If Analysis  what happens.
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 7.6 Linear Programming.
Linear Inequalities and Linear Programming Learning Outcomes  I can solve a linear inequality  I can graph a linear inequality  I can find the region.
Graphing Linear Inequalities in Two Variables Chapter 4 – Section 1.
Solve problems by using 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.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
11C. Linear Programming. What is a linear programming problem? 1.A set of variables (in Further Maths there will only ever be two variables) called decision.
A factory produces two types of drink, an ‘energy’ drink and a ‘refresher’ drink. The day’s output is to be planned. Each drink requires syrup, vitamin.
HW # Due:
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Intro to Linear Programming
Spring 2015 Mathematics in Management Science Linear Programming Mixture Problems Dolls & Skateboards.
Linear Programming-Bellwork
Unit 1 Linear programming. Define: LINEAR PROGRAMMING – is a method for finding a minimum or maximum value of some quantity, given a set of constraints.
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 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
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
Section 3-4 Objective: To solve certain applied problems using linear programming. Linear Programming.
© 2009 Prentice-Hall, Inc. 7 – 1 Decision Science Chapter 3 Linear Programming: Maximization and Minimization.
Linear Programming. What is linear programming? Use a system of constraints (inequalities) to find the vertices of the feasible region (overlapping shaded.
1. Solve this system and find the product of its solutions. x + y = 7 2x – y =8 2. The feasible region for a set of constraints has vertices (2,0), (8,2)
Linear Programming: A Geometric Approach3 Graphing Systems of Linear Inequalities in Two Variables Linear Programming Problems Graphical Solution of Linear.
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.
THE PROBLEM – Method 1 Linear Programming : Introductory Example Let x represent number of litres of energy drink Let y represent number of litres of refresher.
Precalculus Section 3.4 Solve problems using linear programming The inequalities that describe all the conditions of a problem are called constraints.
Ardavan Asef-Vaziri Systems and Operations Management
Digital Lesson Linear Programming.
Linear Programming : Introductory Example
Chapter 5 Linear Inequalities and Linear Programming
Digital Lesson Linear Programming.
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
Linear Programming – A First Example
3-3 Optimization with Linear Programming
Linear Programming Objectives: Set up a Linear Programming Problem
3-4 Linear Programming.
3.2 Linear Programming 3 Credits AS
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Models for Simulation & Optimization – An Introduction
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Nature does nothing uselessly.
1.6 Linear Programming Pg. 30.
Linear Programming Mr. Carpenter Alg. 2.
Presentation transcript:

CHAPTER 6:LINEAR PROGRAMMING INTRODUCTION

INPUTS: Resource: Raw material, Labour…and how much of each resource FACTORY: Production process: how much of each of the inputs per unit output. OUTPUTS: What products to manufacture. THE BUSINESS OBJECTIVE: To maximise profit, to minimise costs.

Example What production policy should the company adopt to make the maximum profit? Product Wood Machine-Time Polishing-Time Unit Profit Table 4 Kilos 2 Hours 1 hour £4 Chair 1 Kilo lHour £3 Resource 90 50 40  

OUTPUTS: Tables and Chairs INPUTS: The following resources with the availability as given: WOOD: 90 Kilograms available per week. MACHINE-TIME: 50 hours available per week. POLISHING-TIME: 40 hours available per week. FACTORY: One Table requires 4 Kilograms of Wood, 2 hours of Machine-Time and 1 hour of Polishing-Time. One Chair requires 1 Kilograms of Wood, 1 hour of Machine-Time and 1 hour of Polishing-Time. BUSINESS OBJECTIVE: How much is Tables and Chairs to be manufactured that leads to maximum profits.

SOLVING THIS PROBLEM Graphical Solution an Intuitive Approach Stage 1: The set of all possible production plans that meet all the factory input constraints are evaluated. Stage 2: From the set of all possible production plans the particular production plan that meets the business objective is found.

Wood resource constraints If all Wood is used to make only Tables then a maximum of 22.5 tables per week can be made. If all Wood is used to make only Chairs then a maximum of 90 Chairs per week can be made.

RESULT 1 : Any point that lies on a constraint line uses the exact amount of the resource that is available. RESULT 2: Any point under the constraint line uses less of the resource that is available. RESULT 3 : Any point above the constraint line uses more of the resource than is available.

Machine-Time resource constraint Using all the Machine-Time to make only Tables would enable a maximum of 25 Tables per week to be made. Using all the Machine-Time to make only Chairs then a maximum of 50 Chairs per week could be made.

Polishing-Time resource constraints If all the Polishing-Time is used to make only Tables then 40 Tables per week could be made. If all the Polishing-Time is used to make only Chairs the 40 Chairs per week could be made. Feasible Region: OABCD

Stage 2 Move vertically upwards: (15,20) Starting point: (15,15) Profit = £(4*15 + 3*15) = £105 Move vertically upwards: (15,20) Profit = £(4*15+ 3*20) = £120 Move down the Machine-Time line: (16,18) Profit = £(4*16+ 3*18) = £118 Move up the Machine-Time line: (14,22) Profit = £(4*14+ 3*22) = £122

The profit increasing direction: moving up along the Machine-Time line Point B: (10,30) Profit = £(4*10+ 3*30) = £130 Profit maximising production plan can reach at a corner point. Profit maximising production plan is: Make 10 Tables and 30 Chairs, this will give the largest possible profit of £130

WHAT IS LINEAR PROGRAMMING? To find the particular production plan that maximises a linear profit function, when production is constrained by a set of linear constraints.