The Management Science Approach

Slides:



Advertisements
Similar presentations
1 1 Slide Chapter 1 & Lecture Slide Body of Knowledge n Management science Is an approach to decision making based on the scientific method Is.
Advertisements

College of Information Technology & Design
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
BU BU Decision Models Networks 1 Networks Models Summer 2013.
Session II – Introduction to Linear Programming
Transportation Problem (TP) and Assignment Problem (AP)
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Introduction to Mathematical Programming OR/MA 504 Chapter 6 Goal programming and Multiple Objective Optimization.
Basic Feasible Solutions: Recap MS&E 211. WILL FOLLOW A CELEBRATED INTELLECTUAL TEACHING TRADITION.
Example 14.3 Football Production at the Pigskin Company
Optimization using Calculus
Linear Programming Building Good Linear Models And Example 1 Sensitivity Analyses, Unit Conversion, Summation Variables.
Linear Programming Introduction. linear function linear constraintsA Linear Programming model seeks to maximize or minimize a linear function, subject.
Network Optimization Models: Maximum Flow Problems In this handout: The problem statement Solving by linear programming Augmenting path algorithm.
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 Applications
Computational Methods for Management and Economics Carla Gomes Module 4 Displaying and Solving LP Models on a Spreadsheet.
Linear Programming Optimal Solutions and Models Without Unique Optimal Solutions.
Linear Programming Example 2 Alternate Optimal Solutions.
The Game of Algebra or The Other Side of Arithmetic The Game of Algebra or The Other Side of Arithmetic © 2007 Herbert I. Gross by Herbert I. Gross & Richard.
Ch 10.3 Solving Radical Equations Objective: To solve equations involving square roots (and equations involving perfect squares).
Chapter 19 Linear Programming McGraw-Hill/Irwin
Chapter 6.  Pg. 364 – 369  Obj: Learn how to solve systems of equations by graphing and analyze special systems.  Content Standard: A.REI.6.
Linear Programming Chapter 13 Supplement.
The Supply Chain Customer Supplier Manufacturer Distributor
Introduction to Management Science Chapter 1: Hillier and Hillier.
Linear Programming: Basic Concepts
Operations Management
Types of IP Models All-integer linear programs Mixed integer linear programs (MILP) Binary integer linear programs, mixed or all integer: some or all of.
Chapter 7 Transportation, Assignment & Transshipment Problems
Managerial Decision Making and Problem Solving
Chapter 6 Linear Programming: The Simplex Method Section R Review.
BUSINESS MATHEMATICS & STATISTICS. LECTURE 45 Planning Production Levels: Linear Programming.
Introduction A GENERAL MODEL OF SYSTEM OPTIMIZATION.
Systems of Inequalities in Two Variables Sec. 7.5a.
Linear Programming Introduction: Linear programming(LP) is a mathematical optimization technique. By “Optimization” technique we mean a method which attempts.
Decision Making.
1 Spreadsheet Modeling & Decision Analysis: A Practical Introduction to Management Science, 3e by Cliff Ragsdale.
Revision Linear Optimisation. A miller can buy wheat from three suppliers: Airey Farm, Berry Farm and Cherry Farm. In each case the wheat is contaminated.
Model 2: Transportation Problem Roshnika Fernando.
Linear Programming last topic of the semester What is linear programming (LP)? Not about computer programming “Programming” means “planning” “Linear” refers.
Arben Asllani University of Tennessee at Chattanooga Prescriptive Analytics CHAPTER 7 Business Analytics with Shipment Models Business Analytics with Management.
Location decisions are strategic decisions. The reasons for location decisions Growth –Expand existing facilities –Add new facilities Production Cost.
Introduction Hamdy A. Taha, Operations Research: An introduction, 8th Edition.
Chapter 1 Introduction n Introduction: Problem Solving and Decision Making n Quantitative Analysis and Decision Making n Quantitative Analysis n Model.
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.
Two Discrete Optimization Problems Problem: The Transportation Problem.
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
Part 3 Linear Programming
Lesson 1-8 Solving Addition and Subtraction Equations.
Log Truck Scheduling Problem
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
Linear Programming Optimal Solutions and Models Without Unique Optimal Solutions.
Simplex Method Simplex: a linear-programming algorithm that can solve problems having more than two decision variables. The simplex technique involves.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Transportation and Distribution Planning Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Techologies.
System of Equations Solve by Substitution. A System of Equations:  Consists of two linear equations  We want to find out information about the two lines:
Business Mathematics MTH-367 Lecture 14. Last Lecture Summary: Finished Sec and Sec.10.3 Alternative Optimal Solutions No Feasible Solution and.
::Network Optimization:: Minimum Spanning Trees and Clustering Taufik Djatna, Dr.Eng. 1.
© 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Introduction Hamdy A. Taha, Operations Research: An introduction, 8th Edition Mjdah Al Shehri.
19 Profit-Maximization.
Why network models? Visualize a mathematical model
Linear Programming Introduction.
Linear Programming Introduction.
Introduction Hamdy A. Taha, Operations Research: An introduction, 8th Edition Mjdah Al Shehri.
Spreadsheet Modeling & Decision Analysis:
REVIEW FOR EXAM 1 Chapters 3, 4, 5 & 6.
Presentation transcript:

The Management Science Approach Mathematical Modeling and Solution Procedures

Building a Mathematical Model A mathematical model can consist of: A set of decision variables An objective function Constraints Functional Nonnegativity Constraints First create a model shell Gather data -- consider time/cost issues for collecting, organizing, sorting data for generating a solution for using the model

EXAMPLE Suppose a motorhome compnay has inventory of motorhomes at their production facilities which they wish to transport to various retail dealerships -- at minimum cost Motorhomes will be driven one at a time from a production facility to a dealership

Issues How many production facilities are there? What is the supply at each facility? How many dealerships desire the motorhomes? How many did each dealership order? Transportation costs between each production facility and each dealership Consider mileage, salaries, tolls, insurance, etc.

Pictorial Model P2 P1 R3 R1 R2 $6 Demand 12 15 22 Supply 20 30 $5 $10 Production Facilities P1 R3 R1 R2 Retail Dealerships $6 Transportation Costs ($100’s) Demand 12 15 22 Supply 20 30 $5 $10 $14 $11 $8

Definition of Decision Variables X1 = amount transported from P1 to R1 X2 = amount transported from P1 to R2 X3 = amount transported from P1 to R3 X4 = amount transported from P2 to R1 X5 = amount transported from P2 to R2 X6 = amount transported from P2 to R3

Objective/Objective Function Objective -- Minimize Total Transportation Cost It costs $600 to drive a motorhome from P1 to R1 How many will we send from P1 to R1? We don’t know But the symbol for the amount we ship from P1 to R1 is X1 Thus the total cost of transporting motorhomes from P1 to R1 is $600X1 Other costs are similarly figured Thus the objective function is: MIN 600X1 + 800X2 + 1100X3 + 1000X4 + 500X5 + 1400X6

Production Facility Constraints From each production, we cannot transport more motorhomes from a facility than are available. How many will we transport from P1? We will transport X1 to R1, X2 to R2, and X3 to R3 Thus the total amount we transport from P1 is: X1 + X2 + X3 What is the maximum we transport from P1? The supply which is 20 Thus we have the following constraint for P1: X1 + X2 + X3  20 Similarly for P2: X4 + X5 + X6  30

Retail Dealership Constraints Each dealership should receive exactly the number of orders it placed How many motorhomes will R1 receive It will receive X1 from P1 and X4 from P2 This should equal their order -- 12 Thus, the constraint for S1 is: X1 + X4 = 12 Similarly for dealerships R2 and R3: R2: X2 + X5 = 15 R3: X3 + X6 = 22

Nonnegativity Constraints We cannot transport a negative number of motorhomes from a production facility to a retail dealership. Thus: X1  0, X2  0, X3  0, X4  0, X5  0, X6  0 We write this simply as: All X’s  0

The Complete Mathematical Model MIN 6X1 + 8X2 + 11X3 + 10X4 + 5X5 + 14X6 (in $100’s) S.T. X1 + X2 + X3  20 X4 + X5 + X6  30 X1 + X4 = 12 X2 + X5 = 15 X3 + X6 = 22 All X’s  0

Model Solution Choose an appropriate solution technique Generate model solution Test/validate model results Return to modeling if results are unacceptable Perform “what-if” analyses

Solution to the Model Our example fits the requirements for what is called a transportation model. We can use an approach called linear programming or us a template that is specifically designed to solved these specially structured problems.

INPUT Supplies Demands Unit Costs OUTPUT Total Shipped Total Received Amount Transported Total Transportation cost

Analysis From P1 send 12 to R1 and 8 to R3 1 motorhome remains in P2 The total cost is $431 (in $100’s) or $43,100 Any other transportation scheme would cost more.

Review Solution When the model is solved it should be reviewed to check for any obvious inconsistencies. If the model is not performing as expected it can be changed at this time This solve/review process continues until the model produces “reasonable” results. If this does not happen the problem definition may have to be re-visited Additional experts can add input. The results are then ready for reporting and implementation.

Review Mathematical models consist of: Decision variables Objective function Constraints Model shell should be built prior to collecting data. Models are solved and checked to see if results are reasonable Revision/additional input may be needed. Model results are reported to decision maker.