LINEAR PROGRAMMING AND APPLICATIONS Graduate Program in Business Information Systems Aslı Sencer.

Slides:



Advertisements
Similar presentations
Chapter 3: Linear Programming Modeling Applications © 2007 Pearson Education.
Advertisements

Introduction to Mathematical Programming
Lesson 08 Linear Programming
Linear Programming We are to learn two topics today: LP formulation
Linear Programming Problem
Linear Programming Models & Case Studies
Introduction to Management Science
Operations Management Linear Programming Module B - Part 2
Marketing Applications: Media selection
8/27: Linear Programming Lecture: LP Small Groups Homework.
Linear Programming Using the Excel Solver
Managerial Decision Modeling with Spreadsheets
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
© 2008 Prentice-Hall, Inc. Chapter 7 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created.
Linear Programming Introduction George B Dantzig developed LP in It is a problem solving approach designed to help managers/decision makers in planning.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Three Classic Applications of LP Product Mix at Ponderosa Industrial –Considered limited.
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.
Operations Management
B-1 Operations Management Linear Programming Module B.
QM B Linear Programming
Linear Programming (6S) and Transportation Problem (8S)
Integer Programming Integer programming is a solution method for many discrete optimization problems Programming = Planning in this context Origins go.
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
1 Lecture 2 & 3 Linear Programming and Transportation Problem.
1 Lecture 2 MGMT 650 Linear Programming Applications Chapter 4.
B-1 Operations Management Linear Programming Module B.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
INTRODUCTION TO LINEAR PROGRAMMING
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
Linear Programming Models: Graphical and Computer Methods
9/1 More Linear Programming Collect homework Roll call Review homework Lecture - More LP Small Groups Lecture - Start using MS Excel Assign Homework.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
Graduate Program in Business Information Systems Integer and Goal Programming Aslı Sencer.
Graduate Program in Business Information Systems Linear Programming: Sensitivity Analysis and Duality Aslı Sencer.
3.4 Linear Programming.
1 Chapter 8 Linear programming is used to allocate resources, plan production, schedule workers, plan investment portfolios and formulate marketing (and.
Product Mix Problem Monet company makes four types of frames.
On LT simulation Game ends at 8:45 p.m.
Chapter 3: Linear Programming Modeling Applications
Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.
Integer Programming Integer programming is a solution method for many discrete optimization problems Programming = Planning in this context Origins go.
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.
BUSINESS MATHEMATICS & STATISTICS. LECTURE 45 Planning Production Levels: Linear Programming.
Opener. Notes: 3.4 Linear Programming Optimization  Many real-life problems involve a process called optimization.  This means finding a maximum or.
MIS 463: Decision Support Systems for Business Review of Linear Programming and Applications Aslı Sencer.
Transportation and Assignment Problems
Linear Programming: Formulation and Applications Chapter 3: Hillier and Hillier.
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.
1 Linear Programming (LP) 線性規劃 - George Dantzig, 1947.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
ENGM 631 Optimization Ch. 3: Introduction to Linear Programming.
Math Programming Concept of Optimization (L.O. a ) Linear Programming Managerial Value of Information (L.O. d) Theory (L.O. b) Example Applications (L.O.
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
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.
CDAE Class 12 Oct. 4 Last class: 2. Review of economic and business concepts Today: 3. Linear programming and applications Quiz 3 (sections 2.5 and.
1 Ardavan Asef-Vaziri June-2013LP-Formulation Additional Problems.
LINEAR PROGRAMMING MEANING:
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
LINEAR PROGRAMMING. Linear Programming Linear programming is a mathematical technique. This technique is applied for choosing the best alternative from.
-114- HMP654/EXECMAS Linear Programming Linear programming is a mathematical technique that allows the decision maker to allocate scarce resources in such.
Linear Programming Wyndor Glass Co. 3 plants 2 new products –Product 1: glass door with aluminum framing –Product 2: 4x6 foot wood frame window.
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.
Linear Programming Applications
1 Chapter 9 If one would take statistics about which mathematical problem is using most of the computer time in the world (not including data base handling.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Linear Programming Models: Graphical and Computer Methods
Operations Management Linear Programming Module B
MBA 651 Quantitative Methods for Decision Making
Integer Programming.
Module B Linear Programming.
Presentation transcript:

LINEAR PROGRAMMING AND APPLICATIONS Graduate Program in Business Information Systems Aslı Sencer

OPERATIONS RESEARCH BIS 517-Aslı Sencer 2 What is Operations Research?  Collection of techniques used to  allocate the scarce resources  in the “best” –OPTIMAL – way! Best of what?  We need an “objective” to be minimized or maximized!  Profit, Cost, Utility, Delay, Distance, Flow, etc.

Some applications BIS 517-Aslı Sencer 3 Resource allocation Production and inventory planning Capacity Planning Workers and machine scheduling Investment planning Formulating marketing and military strategies

Some news about OR: BIS 517-Aslı Sencer 4 A Wall Street Journal Article lists the use of LP as one of the greatest technological innovations of the past 1000 years Nobel Prize for economics: T.C. Koopmans and L.V. Kantoprovich for their contributions in the field 1992 Nobel Prize: Harry Markowitz for his LP based research.

Basic Optimization Techniques BIS 517-Aslı Sencer 5 Linear Programming Integer and Goal Programming  Transportation, Assignment Models  Network Models Nonlinear Programming Stochastic Programming Also Simulation

LINEAR PROGRAMMING BIS 517-Aslı Sencer 6 Most successful of all modern quantitative methods. Program here is not a computer code! It is a plan that efficiently allocate limited resources to achive a goal. Involves linear relationships, i.e. relations are in the form of lines, planes!

Basic LP Models: Product Mix Redwood Furniture Co. Resource Unit Requirements Amount Available in a Period TableChair Wood (ft) Labor (hrs) Unit profit$6$8 BIS 517-Aslı Sencer 7

What is the optimal plan to max. Profit? BIS 517-Aslı Sencer 8 Option 1: Allocate all resources to the more profitable item. Total quantity, profit? Any resource left? Option 2: Is it more profitable to produce less chairs and more tables? Linear Programming

Formulating a Linear Problem Define variables: : number of tables produced in a period : number of chairs produced in a period Define constraints: Define Objective Function BIS 517-Aslı Sencer 9

How is an LP solved? BIS 517-Aslı Sencer 10 Graphical Method: Applicable to a maximum of two decision variables. Simplex Method: Applicable to all LP. Takes long to implement manually. Use softwares based on simplex and other techniques.

Graphical Solution BIS 517-Aslı Sencer 11 Constraint 1 Constraint Optimal Solution: Xt=4 tables, Xc=9 Chairs Profit*=$96 (4,9) XtXt XcXc

Basic LP Models: Feed Mix Two types of seeds are mixed to formulate the wheat of wild birdseed. Nutritional Item Proportional Content Total Requirement Buckwheat Sunflower wheat Fat.04.06≥480 lb Protein.12.10≥1200 lb Roughage.10.15≤1500 Cost per lb$.18$.10 BIS 517-Aslı Sencer 12

LP Formulation BIS 517-Aslı Sencer 13

Graphical Solution to Feed Mix Problem BIS 517-Aslı Sencer 14 Fat Roughage Protein ( 15000,0 ) (10000,0) (3750,7500) XbXb XsXs Optimal Solution: X b *=3750 lb, X s *=7500 lb Cost*=$1425

Types of Feasible Regions BIS 517-Aslı Sencer 15 Bounded Feasible Region Unbounded Feasible Region

Cases in an LP: Infeasible Solution BIS 517-Aslı Sencer 16 No feasible region If an LP has no feasible region, then the solution is INFEASIBLE! Do all LP has an optimal Solution?

Cases in an LP: Multiple Optima BIS 517-Aslı Sencer 17 Optimal Solutions: Point(1): X 1 *=4 2/7, X 2 *=6 3/7 Point(2): X 1 *=6 6/7, X 2 *=4 2/7 P*=$120 (1) (2) Infinite number of optimal solutions exist in the form

Cases in an LP: Unbounded Optimal Solution BIS 517-Aslı Sencer 18 Optimal Solution: X 1 *=, X 2 *= P*=

Solving Linear Programs with a Spreadsheet BIS 517-Aslı Sencer 19 Write out the formulation table Put the formulation table into a spreadsheet Use Excel’s Solver to obtain a solution

Solution in the Excel Solver BIS 517-Aslı Sencer 20

Applications of LP:Transportation Models BIS 517-Aslı Sencer 21 Sporting goods company Capacity Plants Warehouses Demand Juarez Seoul Tel Aviv Yokohama Phoenx NY Frankfurt

LP:Transportation Models (cont’d.) From Plant Destination FrankfurtNYPhoenixYokohama Juarez $19$7$3$21 Seoul Tel Aviv BIS 517-Aslı Sencer 22 Shipping Costs per pair of skis What are the optimal shipping quantities from the plants to the warehouses, if the demand has to be met by limited capacities while the shipping cost is minimized?

LP:Transportation Models (cont’d.) X ij : Number of units shipped from plant i to warehouse j. i=1,2,3 and j=1,2,3,4. Minimize shipping costs=19X 11 +7X 12 +3X X X X X 23 +6X X X X X 34 From Plant Destination Capacity FrankfurtNYPhoenixYokohama JuarezX11X12X13X14100 SeoulX21X22X23X24300 Tel AvivX31X32X33X34200 Demand BIS 517-Aslı Sencer 23

LP:Transportation Models (cont’d.) BIS 517-Aslı Sencer 24 subject to #shipped from a plant can not exceed the capacity: X 11 +X 12 +X 13 +X 14 ≤ 100 (Juarez Plant) X 21 +X 22 +X 23 +X 24 ≤ 300 (Seoul Plant) X 31 +X 32 +X 33 +X 34 ≤ 200 (Tel Aviv Plant) #shipped to a warehouse can not be less than the demand: X 11 +X 21 +X 31 ≥ 150 (Frankfurt) X 12 +X 22 +X 32 ≥ 100 (NY) X 13 +X 23 +X 33 ≥ 200 (Phoenix) X 14 +X 24 +X 34 ≥ 150 (Yokohama) Nonnegativity X ij ≥0 for all i,j.

LP:Transportation Models (cont’d.) BIS 517-Aslı Sencer 25 Capacity Plants Warehouses Demand Juarez Seoul Tel Aviv Yokohama Phoenx NY Frankfurt Optimal Solution: Optimal cost=$6,

LP: Marketing Applications How to allocate advertising budget between mediums such as TV, radio, billboard or magazines? Ex: Real Reels Co. Allocated ad. Budget=$100,000 PlayboyTrueEsquire Readers10 million6 million4 million Significant Buyers 10%15%7% Cost per ad$10,000$5,000$6,000 Exposures per ad 1,000,000900,000280,000 BIS 517-Aslı Sencer 26 No more than 5 ads in True and at least two ads in Playboy and Esquire

LP: Marketing Applications (cont’d.) BIS 517-Aslı Sencer 27 Not integer?

LP: Assignment Models Assignment of a set of workers to a set of jobs Individual Time required to complete one job DrillingGrindingLathe Ann5min10min Bud10515 Chuck15 10 BIS 517-Aslı Sencer 28

LP: Assignment Models (cont’d.) BIS 517-Aslı Sencer 29

LP: Diet Problem BIS 517-Aslı Sencer 30 How much to use of each ingredient so that the nutritional requirements are met in the cheapest way? Ex: Feed Mix problem given at the beginning of the lecture

LP:Labor Planning BIS 517-Aslı Sencer 31 Addresses staffing needs over a specific time period. Hong Kong Bank of Commerce:  12 Full time workers available, but may fire some.  Use part time workers who has to work for 4 consequtive hours in a day.  Luch time is one hour between 11a.m. and 1p.m. shared by full time workers.  Total part time hours is less than 50% of the day’s total requirement.  Part-timers earn $4/hr (=$16/day) and full timers earn $50/day.

LP:Labor Planning (Cont’d.) Time PeriodMinimum labor required 9a.m.-10a.m.10 10a.m.-11a.m.12 11a.m.-noon14 Noon-1p.m.16 1p.m.-2p.m.18 2p.m.-3p.m.17 3p.m.-4p.m.15 4p.m.-5p.m.10 BIS 517-Aslı Sencer 32

LP:Labor Planning (cont’d.) BIS 517-Aslı Sencer 33