Chapters 16-18 Multiple-Goal Decision Analysis II Goals as constraints –TPS example –Constrained optimization –Linear programming System Analysis Dealing.

Slides:



Advertisements
Similar presentations
PowerPoint Slides by Robert F. BrookerCopyright (c) 2001 by Harcourt, Inc. All rights reserved. Linear Programming Mathematical Technique for Solving Constrained.
Advertisements

Linear Programming Problem
Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
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.
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
2-1 Linear Programming: Model Formulation and Graphical Solution Chapter 2 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
Linear Programming: Simplex Method and Sensitivity Analysis
Managerial Decision Modeling with Spreadsheets
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
Introduction to Linear and Integer Programming
Chapters Net value and marginal analysis Decision rules Example Present value analysis Reconciling present and future cash flows Discounting Figures.
The Rational Decision-Making Process
An Introduction to Linear Programming : Graphical and Computer Methods
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
Linear and Integer Programming Models
1 Linear Programming Using the software that comes with the book.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Spreadsheet Modeling & Decision Analysis:
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
Linear Programming.
Introduction to Optimization (Part 1)
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.
Linear Programming Models: Graphical and Computer Methods
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Chapter 4 An Introduction to Optimization
9-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Multicriteria Decision Making Chapter 9.
Multicriteria Decision Making
Chapter 2 Linear Programming Models: Graphical and Computer Methods
3.4 Linear Programming.
Module B: Linear Programming
Highline Class, BI 348 Basic Business Analytics using Excel, Chapter 01 Intro to Business Analytics BI 348, Chapter 01.
Linear Programming: Basic Concepts
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.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
BUSINESS MATHEMATICS & STATISTICS. LECTURE 45 Planning Production Levels: Linear Programming.
Introduction Pertemuan 1 Matakuliah: K0442-Metode Kuantitatif Tahun: 2009.
PowerPoint Slides by Robert F. BrookerHarcourt, Inc. items and derived items copyright © 2001 by Harcourt, Inc. Managerial Economics in a Global Economy.
Goal Programming Linear program has multiple objectives, often conflicting in nature Target values or goals can be set for each objective identified Not.
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.
Chapter 1 Introduction n Introduction: Problem Solving and Decision Making n Quantitative Analysis and Decision Making n Quantitative Analysis n Model.
Optimization unconstrained and constrained Calculus part II.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Table of Contents CD Chapter 14 (Solution Concepts for Linear Programming) Some Key Facts.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Calculus-Based Optimization AGEC 317 Economic Analysis for Agribusiness and Management.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
LINEAR PROGRAMMING. Linear Programming Linear programming is a mathematical technique. This technique is applied for choosing the best alternative from.
Fundamentals of Software Engineering Economics (II) 1 LiGuo Huang Computer Science and Engineering Southern Methodist University Software Engineering Economics.
Don Sutton Spring LP Basic Properties Objective Function – maximize/minimize profit/cost Resource Constraints – labor, money Decision.
Business Mathematics MTH-367 Lecture 14. Last Lecture Summary: Finished Sec and Sec.10.3 Alternative Optimal Solutions No Feasible Solution and.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Linear Programming Models: Graphical and Computer Methods 7 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Micro Economics in a Global Economy
Linear Programming: Sensitivity Analysis and Duality
Managerial Economics in a Global Economy
Duality Theory and Sensitivity Analysis
Chapters Multiple-Goal Decision Analysis II
Chapters Multiple-Goal Decision Analysis II
Fundamentals of Software Engineering Economics (III)
Linear Programming Problem
Chapters Multiple-Goal Decision Analysis II
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
Calculus-Based Optimization AGEC 317
Dr. Arslan Ornek MATHEMATICAL MODELS
Presentation transcript:

Chapters Multiple-Goal Decision Analysis II Goals as constraints –TPS example –Constrained optimization –Linear programming System Analysis Dealing with unquantifiable goals –Preference table –Screening matrix –Presentation techniques for mixed criteria

TPS Decision Problem 5 Option A operating system: –If one processor fails, system fails Processor reliability: 0.99/hour Mean time to repair: 30 min. System reliability for N processors: –Rel (N) = (0.99) N System availability for N processors – (prob. of failure per time period)(Avg. down time) Length of time period 1 –AV(N) = = 1 – (1-.99 N )(30Min)/(60min) = 1–½ (1-.99 N )

Rel, Av E(N) trans/sec Number of processors, N E(N) DSC = (SC)(E(N))(Av(N)) Rel(N) Av(N) TPS Reliability, Availability, and Performance

Number of processors, N DSC(N) = E(N)*Av(N) TPS Delivered System Capability

Goals as Constraints 1.Can’t afford availability <.98 –Choose N to maximize E(N) = 80N (11-N) subject to AV(N) >.98 2.Can’t afford delivered capacity < 1800 TR/sec –Choose N to maximize AV(N) subject to E(N) > Comm. Line limits E(N) to < 1500 TR/sec; value of TR/sec = $500 (a); $1000(b)

Optimal Solution for TV = 0.5E E=TV NCNC E < E(N) Av > 0.98 NV = 180 NV = 150 E < 1500 NV = 190 NV = 44.5E – 40N – 450 = 200NV =

E=TV NCNC E < E(N) Av > 0.98 NV = 870 E < 1500 NV = 930 NV = 910 Optimal Solution for TV = E E – 40N – 450 = 970NV =

General Optimal Decision Problem With Constraints Choose values of the decision variables –X 1, X 2, …, X n So as to maximize the objective function –f(X 1, X 2, …, X n ) Subject to the constraints –g 1 (X 1, X 2, …, X n ) < b, –g 2 (X 1, X 2, …, X n ) < b 2 – … –g m (X 1, X 2, …, X n ) < b m

Optimal Solution: Necessary and Sufficient Conditions The optimal solution (X 1, X 2, …, X n ) max And the optimal value V max Are characterized by the necessary and sufficient conditions 1.(X 1, X 2, …, X n ) max is a feasible point on the isoquant f(X 1, X 2, …, X n ) = V max 2.If V> V max, then its isoquant f(X 1, X 2, …, X n ) = V does not contain any feasible points

Objective function isoquants g 1 (x 1, …, x n ) = b 1 g 3 (x 1, …, x n ) = b 3 g 2 (x 1, …, x n ) = b 2 x1x1 (Decision variable) xnxn (Decision variable) Decision space Optimal solution Infeasible point Feasible point Feasible set f(x 1, …, x n ) = v 1 = v 2 = v 3 = v 4 = v max = v 5 Geometric View

The Linear Programming Problem Choose X 1, X 2, …, X n So as to maximize –C 1 X 1 + C 2 X 2 + … + C n X n Subject to the costraints –a 11 X 1 + a 12 X 2 + … + a 1n X n < b 1 –a 21 X 1 + a 22 X 2 + … + a 2n X n < b 2 –… –a m1 X 1 + a m2 X 2 + … + a mn X n < b m –X 1 > 0, X 2 > 0, …, X n > 0

Universal Software, Inc. 16 analysts, 24 programmers, 15 hr/day computer Text-processing systems –2 analysts, 6 prog’rs, 3 hr/day comp $20K profit Process control systems –4 analysts, 2 prog’rs, 3 hr/day comp $30K profit How many of each should Universal develop to maximize profit?

Solution Steps 1.What objective are we trying to optimize? 2.What decisions do we control which affect the objective? 3.What items dictate constraints on our range of choices? 4.How are the values of the objective function related to the values of the decision variables? 5.What decision provides us with the optimal value of the objective function?

X2X2 Feasible Set 6x 1 + 2x 2 3x 1 + 3x 2 2x 1 + 4x 2 X1X1 Feasible Set: Universal Software

Feasible set 20x x 2 = 60 20x x 2 = x x 2 = x x 2 = 150 Optimal solution Optimal Solution: Universal Software

Mathematical Optimization Formulation What objectives are we trying to optimize or satisfy? Search What decisions do we control which affect our objectives? What items dictate constraints on our range of choices? Evaluation What criteria should we use to evaluate the alternatives? How are the values of the criterion function related to the values of the decision variables which define the alternatives? What choice provides us with the best criterion value? Interpretation How sensitive is the decision to assumptions made during the analysis? Are there alternative decisions providing satisfactory results with less sensitivity to these assumptions? Formulation Clarifying the objectives, defining the issues of concern, limiting the problem. Search Looking for data and relationships, as well as alternative programs of action that have some chance of solving the problem. Evaluation Building various models, using them to predict the consequences that are likely to follow from each choice of alternatives, and then comparing the alternatives in terms of these consequences. Interpretation Using the predictions obtained from the models, and whatever other information or insight is relevant, to compare the alternatives further, derive conclusions about them, and indicate a course of action. System Analysis [Quade68] Iteration

TPS Decision Problem 6 Cost of option B OS with switchover, restart: $150K Cost of option B OS from vendor: $135K Which should we choose? –Key personnel availability –Staff morale and growth –Controllability –Ease of maintenance

Presentation Techniques Unquantifiable criteria –Criterion summaries –Preference table –Screening matrix Mixed Criteria –Tabular methods –Cost vs. capability graph –Polar graph –Bar charts # CRIT#ALT’S

Summary – Goals As Constraints II Adding constraints can simplify multiple-goal decision problems System analysis approach very similar to constrained optimization –6-step approach –Sensitivity analysis –Satisficing Unquantifiable goals require subjective resolution –But effective presentation techniques can help decision process