IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.

Slides:



Advertisements
Similar presentations
Optimization problems using excel solver
Advertisements

BU Decision Models Integer_LP1 Integer Optimization Summer 2013.
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 (LP) (Chap.29)
Linear Programming Problem
Linear Programming Models & Case Studies
Session II – Introduction to Linear Programming
Transportation Problem (TP) and Assignment Problem (AP)
Chapter 2: Modeling with Linear Programming & sensitivity analysis
ITGD4207 Operations Research
Linear Programming Problem Formulation.
Operations Management Linear Programming Module B - Part 2
Linear Programming Using the Excel Solver
Managerial Decision Modeling with Spreadsheets
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Linear Programming: Formulations & Graphical Solution.
Chapter 2: Linear Programming Dr. Alaa Sagheer
Chapter 6 Linear Programming: The Simplex Method
Operations Management
ENGR 351 Numerical Methods Instructor: Dr. L.R. Chevalier
Environmentally Conscious Design & Manufacturing (ME592) Date: May 3, 2000 Slide:1 Environmentally Conscious Design & Manufacturing Class 24: Optimization.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Chapter 7 Transportation, Assignment & Transshipment Problems Part 1 ISE204/IE252 Prof. Dr. Arslan M. ÖRNEK.
Linear Programming Applications
Linear-Programming Applications
FORMULATION AND GRAPHIC METHOD
Linear programming. Linear programming… …is a quantitative management tool to obtain optimal solutions to problems that involve restrictions and limitations.
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Transportation Model Lecture 16 Dr. Arshad Zaheer
By Saparila Worokinasih
Chapter 19 Linear Programming McGraw-Hill/Irwin
Operations Research Models
Quantitative Methods of Management
Linear Programming Chapter 13 Supplement.
Classifying optimization problems By the independent variables: –Integer optimization --- integer variables –Continuous optimization – real variables By.
The Supply Chain Customer Supplier Manufacturer Distributor
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.
0 A Toy Production Problem  How many units to produce from each product type in order to maximize the profit? ProductMan-PowerMachineProfit Type A3 h1.
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
Managerial Decision Making and Problem Solving
Introduction A GENERAL MODEL OF SYSTEM OPTIMIZATION.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Linear Programming Introduction: Linear programming(LP) is a mathematical optimization technique. By “Optimization” technique we mean a method which attempts.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Location decisions are strategic decisions. The reasons for location decisions Growth –Expand existing facilities –Add new facilities Production Cost.
Introduction to linear programming:- - Linear programming (LP) applies to optimization models in which the objective and constraints functions are strictly.
What is operation research? - The first formal activities of operation research (OR) where initiates in England during world war Π. - following the end.
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.
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.
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.
LINEAR PROGRAMMING.
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Transportation problems Operational Research Level 4
DEPARTMENT/SEMESTER ME VII Sem COURSE NAME Operation Research Manav Rachna College of Engg.
Introduction to Integer Programming Integer programming models Thursday, April 4 Handouts: Lecture Notes.
LINEAR PROGRAMMING. Linear Programming Linear programming is a mathematical technique. This technique is applied for choosing the best alternative from.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Introduction Operations Research (OR) It is a scientific approach to determine the optimum (best) solution to a decision problem under the restriction.
OPTIMIZATION PROBLEMS OF ELECTRIC POWER SUPPLY Томский политехнический университет.
Appendix A with Woodruff Edits Linear Programming Using the Excel Solver Copyright © 2010 by The McGraw-Hill Companies, Inc. All rights reserved.McGraw-Hill/Irwin.
Supply Chain Management By Dr. Asif Mahmood Chapter 9: Aggregate Planning.
Operations Research Chapter one.
Linear Programming Dr. T. T. Kachwala.
MBA 651 Quantitative Methods for Decision Making
Chapter 3 The Simplex Method and Sensitivity Analysis
Chapter 5 Transportation, Assignment, and Transshipment Problems
Presentation transcript:

IT Applications for Decision Making

Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the best utilization of war materials Later used for improving efficiency and productivity in civilian sector Decision situations involve: 1.What are the decision alternatives Infinite alternatives could exist 2.Under what restrictions is the decision made 3.What is an appropriate objective criterion for evaluating the alternatives

OR model example Forming a maximum-area rectangle out of a wire of length L inches Generally

Solving an OR model There is no single general technique to solve all mathematical models Linear programming Linear objective and constraint functions Integer programming Variables assume integers Dynamic programming Original problem can be decomposed into more manageable sub problems Network programming A problem could be modeled as a network Non-linear programming Functions of the model are non-linear Solutions are iteratively obtained by algorithms Iteratively by a set of fixed computational rules Need computer support Often have to use heuristics or rules of thumb Look for a good solution than the optimal solution complexity

Queuing and Simulation Deal with the study of waiting lines Not optimization models but determine measures of performance of the waiting lines What are the common measures? Average waiting time in queue Average waiting time for service Utilization of service facilities Queuing models utilize probability and stochastic models to analyze waiting lines Simulation imitates the behavior of the real system to measure the performance Next best thing to observing the real system

Model development

Phases of an OR study Defining the problem Identification of the three main components Model construction Translation of the problem definition into mathematical relationships Model solution Use well-defined optimization algorithms to solve the model Model validation Checks whether the proposed model adequately predicts the behavior of the system under study Implementation Translation of the results into understandable operating instructions to be issued to the people who will administer the recommended system

Two variable LP Model Reddy Mikks produces both interior and exterior paints from raw materials M1 and M2. A market survey indicates that the daily demand for interior paint cannot exceed that for exterior paint by more than one ton. Maximum daily demand for interior paint is 2 tons. find the optimum product mix that maximizes the total daily profit.

Two variable LP model Three basic components Decision variables that we seek to determine Objective (goal) that we want to optimize (maximize or minimize) Constraints that the solution must satisfy Decision variables X1: Tons of exterior paint produced daily X2: Tons of interior paint produced daily Objective function Maximize (5X1 + 4X2)

Two variable LP model Constraints 6X1 + 4X2 <= 24(1) X1 + 2X2 <= 6(2) X2-X1 <= 1(3) X2 <= 2(4) X1 > 0, X2 > 0(5) Feasible solution: Any solution that satisfies all five constraints Ex: X1 = 3, X2 = 1 What is an optimal solution?

Exercise For the above problem, construct each of the following constraints and express it with a linear left hand side and a constant right hand side The daily demand for interior paint exceeds that of exterior paint by at least one ton The daily usage of raw material M2 in tons is at most 6 and at least 3 The demand for interior paint cannot be less than the demand for exterior paint The minimum quantity that should be produced of both the interior and exterior paint is 3 tons The proportion of interior paint to the total production of both interior and exterior paints must not exceed 5

Graphical solution for the LP model

Graphical solution of the LP model

Minimization Problem

Minimization problem

Graphical solution to the minimization problem

MS Excel Solver Can find an optimal (maximum or minimum) value for a formula in one cell — called the objective cell Subject to constraints, or limits, on the values of other formula cells on a worksheet.

Excel Solver – Add-In (Step 1) File -> Options

Excel Solver – Add-In (Step 2)

Where to find Data tab

Solver interface

Solve an LP using solver

Solve an LP using Solver

Solve an LP model using solver

Application of LP Few of the examples: 1.Urban planning 2.Currency arbitrage 3.Investment 4.Production planning and inventory control 5.Blending and oil refining 6.Manpower planning

Investment Example Investors are presented with multitudes of investment opportunities Examples: Capital budgeting for projects Bond investment strategy Stock portfolio selection Establishment of bank loan policy Role of OR Select the optimal mix of opportunities that will maximize return while meeting the investment conditions set by the investor

Investment decision example – loan policy

Decision Model Variables – Amount of loans in each category X1: personal loans X2: car loans X3: home loans X4: farm loans X5: commercial loans Objective function Maximize z = Total interest – Bad debt Formulate this problem and solve using Excel solver as an exercise

Transportation Model A special class of linear programming that deals with shipping a commodity from a source to a destination Ex. From factories to warehouses Objective: Determining the shipping schedule minimizing the total shipping cost while satisfying the demand and supply constraints General Representation m sources and n destinations: Nodes Routes between sources and destinations represented by arcs (links) Arc represents two information C ij : Cost of transportation between i and j X ij : Amount transported between i and j Unknowns (x ij ) are determined while minimizing the costs (c ij )

Representation of the Transport Model

Example

Model

Transportation Tableau Tableau method is possible since all constraints are equations Total supply from three sources is equal to total demand from destinations Assumption of the transportation algorithm: The model is balanced

Balancing Transportation Model When inequalities exist Ex: Suppose Detroit plant capacity is 1300 (instead of 1500 previously) Total supply (3500 cars) is less than total demand (3700 cars) Solution: Adding a dummy source or a dummy destination to balance the model Dummy source with 200 capacity is added Unit transportation cost is zero since the plant does not exist If supply is higher than demand (Ex. :demand at Denver is 1900 now) Add a dummy destination Add very high unit cost of transportation to avoid the excess moved to the dummy destination

Answer with a Dummy Source