Solving Large-scale Data Envelopment Analysis Problems
碩士 === 國立交通大學 === 工業工程與管理學系 === 100 === Data envelopment analysis (DEA) is a method, utilizing linear programming (LP), to compute relative efficiencies of all decision making units (DMUs). Solving LP problems is easy in theory. However, in practice, computational loading cannot be ignored for large...
Main Authors: | Lai, Sheng-Yung, 賴聖詠 |
---|---|
Other Authors: | Chen, Wen-Chih |
Format: | Others |
Language: | zh-TW |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/98512191531048882439 |
Similar Items
-
A Modeling Language Package for Solving Data Envelopment Analysis Problems
by: Chung, Yueh-Shan, et al.
Published: (2016) -
Using Enhanced Russell Model to Solve Inverse Data Envelopment Analysis Problems
by: G. R. Jahanshahloo, et al.
Published: (2014-01-01) -
Solving Large Scale Vehicle Routing Problem
by: CHUANG, CHIA-YU, et al.
Published: (2019) -
An algorithmic approach to large scale problem solving
by: Popovic, L. M.
Published: (1977) -
An Efficient Approach to Solve the Large-Scale Semidefinite Programming Problems
by: Yongbin Zheng, et al.
Published: (2012-01-01)