About Us
Authorities
Faculty
Staff
Facilities
Working Papers
Placements
Visiting Fellows
Conferences
Collaborations
Announcements
Open Course Ware
Entrance Exam
 
 
  M.A. Programme |  Doctoral Programme
   
  Syllabus M.A. Credit Course Electives
 

Linear Programming and Data Envelopment Analysis

  1. Semester: III/IV
  2. Number of credits: 4

Preamble
The elective is useful for both industrial analysis and policy guidance in an organization. It deals with resource allocation, cost minimization, maximization of profits, accomplishing multiple goals and so on. It also helps in measuring the performances of similar units. It identifies the extent of inefficiency, the causes for inefficiency and suggests the extent to which the performance can be improved. This course will provide hands on computer for applications and analysis.

Evaluation Pattern
The evaluation will be done through 40 marks of continuous evaluation and a 60 marks end-semester examination. The 40 marks of evaluation will consist of a mid-term examination of 20 marks (two questions to be attempted over one hour) and a project of 20 marks on Modules 3 and 4. The project topics will be announced by the 4th teaching week of the semester and the projects should be in by the 10th teaching week. All modules will carry equal weight for the three hour end-semester examination.

Module 1: Linear Programming (12 Lectures)
Formulation, the graphical method, the simplex method, duality, degeneracy, sensitivity analysis Special linear programming problems – the assignment problem, transportation problem, linear programming and game theory, linear programming and input output.

Module 2: Extensions in Linear Programming (12 Lectures)
The decomposition method, goal programming- relationships between goal programming and management science /operations research / multiple criteria decision making

Module 3: Concepts of Data Envelopment Analysis (DEA) (12 Lectures)
Basic Concepts: A Decision-Making Unit; Measurement of Efficiency; Frontier Analysis, Mathematical Programming Aspects of DEA: Fractional DEA programme – use of Linear Programming; primal & dual in the format required for DEA; output- maximization and input-minimization DEA models.

Module 4: Applications (12 Lectures)
Economies of Scale: Variable and Constant Returns to Scale and DEA; Technical and scale efficiencies; Computer applications using industry data; Extensions in DEA: Malmquist Productivity Index, Use of Regressions and sensitivity analysis in DEA.
Practical applications using sectoral data

References
1.

Dorfman R, Paul Samuelson and Robert Solow (1958): Linear programming and Economic Analysis,

McGraw- Hill Book company, Inc New York(Module 1,2)

2.

James P Ignizio (1976): Goal Programming and Extensions, Lexington Books, D.C Health and Company,

Lexington (Module 2)

3.

N.Paul Loomba (1964): Linear Programming: An Introductory Analysis, Tata McGraw –Hill publishing

Company Ltd Bombay-New Delhi (Module 1,2)

4.

N.Paul Loomba. Efraim Turban (1974): Applied Programming for Management, Holt, Rinehart & Winston,

Inc.New York.( Module 1,2,3)

5.

Ramanathan R (2003) An Introduction to Data Envelopment Analysis A Tool for Performance

Measurement, Sage Publications New Delhi (Module 3,4)

6.

Ray Subhash (2004): Data Envelopment Analysis Theory and Techniques for Economics and Operations

Research, Cambridge University Press, UK. (Module 3,4)

7.

Tim Coelli - DEAP - Data Envelopment Analysis (Computer) Programme, Centre for Efficiency and

Productivity Analysis, Department of Econometrics, University of England, Armidale, Australia. ( Module

3,4)

 
  Core Courses  |  Electives
 
Contact: Department of Economics, University of Mumbai, Ranade Bhavan, Third Floor, Vidyanagari, Kalina, Mumbai 400 098.
Tel Nos. Office (Direct) 91-22-26526942, Office (Board) 91-22-26526388, 91-22-6526091 ext. 332, 335 and 333. Director (Direct) 91-22-26528198
© University of Mumbai 2008. All Rights Reserved.