Schedule Reading material for DEA: F:\COURSES\UGRADS\INDR\INDR471\SHARE\reading material Homework 1 is due to tomorrow 17:00 (27-02-2009). Homework 2 will.

Slides:



Advertisements
Similar presentations
Efficiency and Productivity Measurement: Data Envelopment Analysis
Advertisements

IEOR 4004 Midterm review (Part II) March 12, 2014.
Solving LP Models Improving Search Special Form of Improving Search
Lecture 3 Linear Programming: Tutorial Simplex Method
Understanding optimum solution
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
1/53 Slide Linear Programming: Sensitivity Analysis and Interpretation of Solution n Introduction to Sensitivity Analysis n Graphical Sensitivity Analysis.
DMOR DEA. O1O1 O2O2 O3O3 O4O4 O2O2 O7O7 O6O6 OR Variable Returns to Scale Constant Returns to Scale.
Optimization Models Module 9. MODEL OUTPUT EXTERNAL INPUTS DECISION INPUTS Optimization models answer the question, “What decision values give the best.
Schedule On Thursdays we will be here in SOS180 for: – (today) – – Homework 1 is on the web, due to next Friday (17: ).
Linear and Integer Programming Models
Separating Hyperplanes
© 2007 Pearson Education Chapter 14: Solving and Analyzing Optimization Models.
Example 4.7 Data Envelopment Analysis (DEA) | 4.2 | 4.3 | 4.4 | 4.5 | Background Information n Consider a group of three hospitals.
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.
1 Process Benchmarking with Data Envelopment Analysis Chapter 11 Business Process Modeling, Simulation and Design.
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 99 Chapter 4 The Simplex Method.
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
1 Linear Programming Using the software that comes with the book.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Chapter 4 The Simplex Method
Data Envelopment Analysis (DEA). Which Unit is most productive? DMU = decision making unit DMU labor hrs. #cust
Linear Programming.
Solver Linear Problem Solving MAN Micro-computers & Their Applications.
Data Envelopment Analysis. Weights Optimization Primal – Dual Relations.
Kerimcan OzcanMNGT 379 Operations Research1 LP: Sensitivity Analysis and Interpretation of Solution Chapter 3.
LINEAR PROGRAMMING SIMPLEX METHOD.
1 The Role of Sensitivity Analysis of the Optimal Solution Is the optimal solution sensitive to changes in input parameters? Possible reasons for asking.
L20 LP part 6 Homework Review Postoptimality Analysis Summary 1.
Flows and Networks Plan for today (lecture 5): Last time / Questions? Blocking of transitions Kelly / Whittle network Optimal design of a Kelly / Whittle.
Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.
8. Linear Programming (Simplex Method) Objectives: 1.Simplex Method- Standard Maximum problem 2. (i) Greedy Rule (ii) Ratio Test (iii) Pivot Operation.
Linear and Integer Programming Models 1 Chapter 2.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Chapter 6 Sensitivity Analysis & Duality
Public Policy Modeling Simplex Method Tuesday, October 13, 2015 Hun Myoung Park, Ph.D. Public Management & Policy Analysis Program Graduate School of International.
Efficiency Analysis of a Multisectoral Economic System Efficiency Analysis of a Multisectoral Economic System Mikulas Luptáčik University of Economics.
1/24: Linear Programming & Sensitivity Analysis Review: –LP Requirements –Graphical solutions Using MS Excel for Linear Programming Sensitivity Analysis.
CDAE Class 17 Oct. 23 Last class: Result of Quiz 4 3. Linear programming and applications Today: 3. Linear programming and applications Review for.
LP: Summary thus far Requirements Graphical solutions Excel Sensitivity Analysis.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Chapter 6 Simplex-Based Sensitivity Analysis and Duality
Advanced Operations Research Models Instructor: Dr. A. Seifi Teaching Assistant: Golbarg Kazemi 1.
1 1 Slide © 2005 Thomson/South-Western Simplex-Based Sensitivity Analysis and Duality n Sensitivity Analysis with the Simplex Tableau n Duality.
OR Chapter 7. The Revised Simplex Method  Recall Theorem 3.1, same basis  same dictionary Entire dictionary can be constructed as long as we.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Data Envelope Analysis (DEA)
OR Relation between (P) & (D). OR optimal solution InfeasibleUnbounded Optimal solution OXX Infeasible X( O )O Unbounded XOX (D) (P)
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
Economics 2301 Lecture 37 Constrained Optimization.
Lecture notes for Stat 231: Pattern Recognition and Machine Learning 1. Stat 231. A.L. Yuille. Fall 2004 Linear Separation and Margins. Non-Separable and.
CDAE Class 15 Oct. 16 Last class: Result of group project 1 3. Linear programming and applications Class Exercise 7 Today: 3. Linear programming.
CDAE Class 16 Oct. 18 Last class: 3. Linear programming and applications Quiz 4 Today: Result of Quiz 4 3. Linear programming and applications Group.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
Approximation Algorithms based on linear programming.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Review Test 2 BSAD 30 Dave Novak Source: Anderson et al., 2015 Quantitative Methods for Business 13 th edition – some slides are directly from J. Loucks.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Linear Programming: Sensitivity Analysis and Duality
資料包絡分析法 Data Envelopment Analysis-A Comprehensive Text with Models,
Lecture 3.
3 THE CCR MODEL AND PRODUCTION CORRESPONDENCE
Graphical Analysis – the Feasible Region
Sensitivity.
Lecture 4 Part I Mohamed A. M. A..
Linear Programming – Sensitivity Analysis
Optimization Models Module 9.
Applied Statistical and Optimization Models
Presentation transcript:

Schedule Reading material for DEA: F:\COURSES\UGRADS\INDR\INDR471\SHARE\reading material Homework 1 is due to tomorrow 17:00 ( ). Homework 2 will be placed today and it will be due to next Friday ( ).

Fractional Program (FP): Linear Program (LP):

Dual of the Linear Program (DLP-I):

Modified Dual of the Linear Program (DLP-II):

Today We will write and solve the corresponding DLP I and II to analyze a simple DEA problem. Here is our data set: DMUABCDEFG Input I1I I2I OutputO

Graphically...

Obtain file(s): Copy and paste the excel file to your own accounts: F:\COURSES\UGRADS\INDR\INDR471\SHARE\Labs\lab1-DLP-raw.xls Also open the power point file: F:\COURSES\UGRADS\INDR\INDR471\SHARE\labs\DEA-Lab ppt

1 Solve the DLP for DMU A in Excel. Keep the sensitivity report.

1.a What are the efficiencies of DMU A? Is it purely technical (or ratio)? It is only ratio inefficient because 1.Efficiency is <1 2.lagrange multipliers lar weights’dir.values are positive (not mixed inefficient)

1.b What are the values of k ’s? Observe the correspondence between these values and the shadow prices of the LP in part 1. They are in the solution.

1.c Use the values of k ’s to determine the reference set for DMU A, and to compute the level of input for each DMU to be ratio (or purely technical) efficient? Compare your new computations with the levels you found in part 1.b of last week’s lecture. What can you say about the output levels? I1a=I 1a *efficiency=lambda D *Id+lambda E *Ie

1.d What are the shadow prices of the constraints? Observe the correspondence between these values and the optimal weights of the LP solved last week. Lagrange multipliers

1.e Consider DMU A. Construct the hypothetical composite unit (HCU) of A using DLP I, call this unit as DMU Q. I 1a,I 2a are the hypothetical composite unit Solve the DLP I for DMU Q. Verify that DMU Q is efficient. YOU TRY THIS LATER AT HOME…

1 – Repeat for F Solve the DLP for DMU F in Excel. Keep the sensitivity report.

1.a What are the efficiencies of DMU F? Is it purely technical (or ratio)? Mixed inefficiency because efficiency=1 and one of the lagrange multipliers are equal to zero So we have to solve the dual II and find how mixed ineff. is this.

1.b What are the values of k ’s? Observe the correspondence between these values and the shadow prices of the LP in part 1.

1.c Use the values of k ’s to determine the reference set for DMU F, and to compute the level of input for each DMU to be ratio (or purely technical) efficient?

2.d What are the shadow prices of the constraints?

DLP- II Given the value of  * from Phase I, construct and solve the following LP:

2 Let  e * be the efficiency of DMU e that is computed in part 2 for e=F. Use the value of  e * to solve the above LP for DMU F. Keep the sensitivity report.

2.a What are the values of k ’s? Are they different from those you found in part 1? Why?

2.b What are the values of the slack variables for DMU F? Using this information with the solution of DLP I, identify the DMUs as efficient, ratio inefficient, mix inefficient and both ratio and mix inefficient.

2.c Compute the level of input for each DMU to be CCR-efficient. Compare these with your answers of part 1.c.

Hypothetical composite unit (HCU) and target setting for inefficient for DMU e HCU is always CCR-efficient. Input targets: Output targets: CCR projections.

3.a. Discuss the meaning of v 1 of A, and its effect on the efficiency of the corresponding DMUs. How about v 2 ? Compute the efficiency of A if the corresponding input is decreased by one unit.

3.b. How can you interpret the relation between the weights v 1 and v 2 of A, and the corresponding slacks, s 1 - and s 2 -, using the complementary slackness condition?