LINEAR PROGRAMMING INTRODUCTION

Slides:



Advertisements
Similar presentations
Optimization problems using excel solver
Advertisements

Using Solver to solve a minimization LP + interpretation of output BSAD 30 Dave Novak Source: Anderson et al., 2013 Quantitative Methods for Business 12.
Linear Programming Problem
Wyndor Example; Enter data Organize the data for the model on the spreadsheet. Type in the coefficients of the constraints and the objective function.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Table of Contents Chapter 2 (Linear Programming: Basic Concepts) Three Classic Applications.
Introduction to Management Science
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
Linear Programming Using the Excel Solver
Managerial Decision Modeling with Spreadsheets
Chapter 8: Linear Programming
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Three Classic Applications of LP Product Mix at Ponderosa Industrial –Considered limited.
Operations Management Dr. Ron Lembke
Linear Programming Excel Solver. MAX8X 1 + 5X 2 s.t.2X 1 + 1X 2 ≤ 1000 (Plastic) 3X 1 + 4X 2 ≤ 2400 (Prod. Time) X 1 + X 2 ≤ 700 (Total Prod.) X 1 - X.
Chapter 2: Introduction to Linear Programming
QM B Linear Programming
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Table of Contents Chapter 2 (Linear Programming: Basic Concepts) The Wyndor Glass Company.
Computational Methods for Management and Economics Carla Gomes Module 4 Displaying and Solving LP Models on a Spreadsheet.
LINEAR PROGRAMMING: THE GRAPHICAL METHOD
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
Chapter 3 An Introduction to Linear Programming
FORMULATION AND GRAPHIC METHOD
Graphical Solutions Plot all constraints including nonnegativity ones
© Copyright 2004, Alan Marshall 1 Lecture 1 Linear Programming.
Introduction to Linear Programming
Systems of Equations and Inequalities
Table of Contents Chapter 2 (Linear Programming: Basic Concepts)
START EXCEL BUILD OR RETRIEVE YOUR OPTIMIZATION MODEL SAVE YOUR WORKBOOK!! CHOOSE “Solver…” IN THE “Tools” MENU SPECIFY IN SOLVER DIALOG BOX: 1.CELL TO.
Solver & Optimization Problems n An optimization problem is a problem in which we wish to determine the best values for decision variables that will maximize.
Chapter 19 Linear Programming McGraw-Hill/Irwin
1 Chapter 8 Linear programming is used to allocate resources, plan production, schedule workers, plan investment portfolios and formulate marketing (and.
1 1 Slide © 2005 Thomson/South-Western Slides Prepared by JOHN S. LOUCKS ST. EDWARD’S UNIVERSITY.
Linear Programming: Basic Concepts
1 1 Slide Linear Programming (LP) Problem n A mathematical programming problem is one that seeks to maximize an objective function subject to constraints.
We can make Product1 and Product2. There are 3 resources; Resource1, Resource2, Resource3. Product1 needs one hour of Resource1, nothing of Resource2,
1 1 Slide © 2005 Thomson/South-Western Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
LP: Summary thus far Requirements Graphical solutions Excel Sensitivity Analysis.
QMB 4701 MANAGERIAL OPERATIONS ANALYSIS
Linear Programming Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Linear Programming last topic of the semester What is linear programming (LP)? Not about computer programming “Programming” means “planning” “Linear” refers.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization Problem n Graphical Solution Procedure.
Linear Programming Models: Graphical and Computer Methods
Highline Class, BI 348 Basic Business Analytics using Excel Chapter 08 & 09: Introduction to Linear Programing 1.
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.
Constraints Feasible region Bounded/ unbound Vertices
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
Chapter 8 of Quantitative Methods for Business by Anderson, Sweeney and Williams Read sections 8.1, , 8.4 (omitting “Simultaneous Changes”), 8.5,
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Linear Programming Wyndor Glass Co. 3 plants 2 new products –Product 1: glass door with aluminum framing –Product 2: 4x6 foot wood frame window.
EMGT 5412 Operations Management Science Linear Programming: Introduction, Formulation and Graphical Solution Dincer Konur Engineering Management and Systems.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
1 Introduction to Linear Programming Linear Programming Problem Linear Programming Problem Problem Formulation Problem Formulation A Simple Maximization.
An Introduction to Linear Programming
An Introduction to Linear Programming Pertemuan 4
Linear Programming – Introduction
Linear Programming Wyndor Glass Co. 3 plants 2 new products
Wyndor Example; Enter data
Introduction to linear programming (LP): Minimization
Linear Programming Problem
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
BUS-221 Quantitative Methods
Table of Contents Chapter 2 (Linear Programming: Basic Concepts) The Wyndor Glass Company Product Mix Problem (Section 2.1)2.2 Formulating the Wyndor Problem.
Presentation transcript:

LINEAR PROGRAMMING INTRODUCTION Chapter 7 of Quantitative Methods for Business by Anderson, Sweeney and Williams Read sections 7.1, 7.2, 7.3, 7.4, 7.5, 7.6, 7.7 and appendix 7.1

LINEAR PROGRAMMING One of the most widely used M.S. tools Used to solve a wide variety of problems Human Resource Scheduling Routing of Delivery Vehicles Selection of Advertising Media Planning Product Levels in Manufacturing Blending in Oil Refineries Selection of Investment Opportunities and many, many more

LINEAR PROGRAMMING Most widely used solution technique: The Simplex Method Developed by George Dantzig in the 1940’s First used to solve military operations problems during WWII Coincided with the development of the first widely used computers

LINEAR PROGRAMMING MODELS Objective is to minimize or maximize some linear function of the decision variables Constraints are linear equations or inequalities

Homework status Before the next class, you should complete the following homework problems in chapter 7 #1

LINEAR PROGRAMMING MODELS Extremely large models easily solvable using existing computer programs Consider using L.P. Models whenever you are faced with allocating scarce resources among competing activities

LINEAR PROGRAMMING--Introduction to Formulation 3 Steps to Formulate A Linear Programming Problem: DEFINE DECISION VARIABLES FORMULATE OBJECTIVE IDENTIFY CONSTRAINTS

Glass Manufacturer Example A glass company is considering using its excess capacity to manufacture two new products: wood frame windows, which earn $3 profit each, and aluminum frame doors which earn $5 profit, each.

Glass Manufacturer Example There are 4 man-hours / day available in plant 1 (Plant 1 is used for wood frames) 12 man-hours / day available in plant 2 (Plant 2 for aluminum frames) 18 man-hours / day available in plant 3 (Plant 3 for glass and assembly)

Glass Manufacturer Example Each unit of the new products would require the following plant resources (in man-hours): WINDOWS DOORS PLANT 1 1 -- PLANT 2 -- 2 PLANT 3 3 2

Glass Manufacturer Example Formulate the problem: 1. DEFINE DECISION VARIABLES

Glass Manufacturer Example 2. OBJECTIVE FUNCTION

Glass Manufacturer Example 3. IDENTIFY CONSTRAINTS

GRAPHICAL SOLUTION TECHNIQUE Associate the horizontal axis with one decision variable, and associate the vertical axis with the other. Draw the constraints. Identify the feasible region as the area where all the constraints intersect (are “satisfied”).

GRAPHICAL SOLUTION TECHNIQUE Find the optimal solution (the feasible point which gives the best value of the objective). Graph the objective function line for any 2 arbitrary values of Z Identify the improving direction for Z Move a pen parallel to the Z lines in the improving direction as far as possible Last feasible point pen touches is the optimal solution

GRAPHICAL SOLUTION TECHNIQUE How to find the coordinates of the optimal point? Identify the (2) constraints which go through the point Solve those (2) constraint equations simultaneously

Homework status Before the next class, you should complete the following homework problems in chapter 7 #3, #7, #8, #11 (by hand), #24 (by hand), and #31 (by hand)

POSSIBLE ANSWERS A unique (extreme point) optimal solution Alternate optimal solutions An unbounded solution An infeasible problem

IMPORTANT ASSUMPTIONS OF LINEAR PROGRAMMING PROBLEMS LINEARITY OF OBJECTIVE AND CONSTRAINTS i.e. they can be written in the form: C1X1+C2X2+…+CnXn  RHS where the Xis are the decision variables, the Cis are (constant) coefficients, and RHS is the (constant) RHS DIVISIBILITY OF DECISION VARIABLES i.e. they may take fractional values

Using Excel to solve an LP Label one row for each of these: Objective function coefficients Values of the decision variables Each constraint. Label one column for each of these: Each decision variable Total value of the left hand side Right hand side value.

Using Excel to solve an LP Key in coefficients from constraints (blue border) Key in right-hand-side values for constraints (blue border) Key in objective function coefficients (blue border)

Using Excel to solve an LP Designate cells for decision values (red border) Designate cell for objective function value (double black border)

Using Excel to solve an LP Specify formula for left-hand-sides of constraints, using the SUMPRODUCT function Specify formula of Objective Function Value cell, using the SUMPRODUCT function

Using Excel to solve an LP (Key in any values for decision variables Try different values, to see what happens to left-hand- side values and objective value) Click Data  Analysis  Solver Specify “Target Cell” as the objective function value (cell with double black border)

Using Excel to solve an LP Click MAX (or MIN) Specify “changing cells” as decision variable value cells (cells with red border) Click “Add” to add constraints, one (or several) at a time by selecting each: Total Left-hand-side cell(s) Appropriate inequality/equality sign Right-hand-side cell(s)

Using Excel to solve an LP Be sure the box next to “Make Unconstrained Variables Non-negative” is checked. By “Select a Solving Method”, choose “Simplex LP” Click SOLVE Study the solution to be sure it is reasonable (including feasible) and modify/correct the model and resolve if it is not.

Homework help See Solver Hints file (on Blackboard, under Module2 Linear Programming) if you need help.

Homework status Before the next class, you should complete the following homework problems in chapter 7 #11 (on Excel), #24 (on Excel), #31 (on Excel)