Primal-dual correspondence and frontier projections in two-stage network DEA models

被引:59
|
作者
Lim, Sungmook [1 ]
Zhu, Joe [2 ]
机构
[1] Dongguk Univ Seoul, Dongguk Business Sch, 30 Pildong Ro 1 Gil, Seoul 04620, South Korea
[2] Worcester Polytech Inst, Robert A Foisie Sch Business, Worcester, MA 01609 USA
基金
新加坡国家研究基金会;
关键词
Data envelopment analysis (DEA); Two-stage; Frontier projection; Efficiency; Duality; Production possibility set; EFFICIENCY DECOMPOSITION;
D O I
10.1016/j.omega.2018.06.005
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The standard data envelopment analysis (DEA) procedure involves solving a pair of two types of models, multiplier model and envelopment model, and one of the most interesting features of DEA is that these two types of models are equivalent due to duality in linear programming. However, while several prominent network DEA models have been proposed in the literature in multiplier and/or envelopment forms, it is still doubtful or unclear whether and how the same primal-dual correspondence can be retained between the two types of network DEA models as in the standard DEA. To address this issue, we develop an axiomatic derivation of some two-stage network DEA models in this paper focusing on the basic two-stage serial process structure. We define the production possibility set for the basic two-stage serial process based upon some reasonable axiomatic properties. Subsequently we develop envelopment network DEA models using different distance measures, which are then shown to result in well-known existing two-stage network DEA models in the multiplier form. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:236 / 248
页数:13
相关论文
共 50 条
  • [31] Stability of primal-dual gradient dynamics and applications to network optimization
    Feijer, Diego
    Paganini, Fernando
    [J]. AUTOMATICA, 2010, 46 (12) : 1974 - 1981
  • [32] Quantized Primal-Dual Algorithms for Network Optimization With Linear Convergence
    Chen, Ziqin
    Liang, Shu
    Li, Li
    Cheng, Shuming
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2024, 69 (01) : 471 - 478
  • [33] PRIMAL-DUAL APPROXIMATION ALGORITHM FOR GENERALIZED STEINER NETWORK PROBLEMS
    WILLIAMSON, DP
    GOEMANS, MX
    MIHAIL, M
    VAZIRANI, VV
    [J]. COMBINATORICA, 1995, 15 (03) : 435 - 454
  • [34] A Novel Learned Primal-Dual Network for Image Compressive Sensing
    Zhang, Chaolong
    Liu, Yuanyuan
    Shang, Fanhua
    Li, Yangyang
    Liu, Hongying
    [J]. IEEE ACCESS, 2021, 9 : 26041 - 26050
  • [35] Distributed Network Monitoring and Multicommodity Flows: A Primal-Dual Approach
    Awerbuch, Baruch
    Khandekar, Rohit
    [J]. PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2007, : 284 - 291
  • [36] On Automatic Question Answering Using Efficient Primal-Dual Models
    Osmanlioglu, Yusuf
    Shokoufandeh, Ali
    [J]. MULTIMODAL PATTERN RECOGNITION OF SOCIAL SIGNALS IN HUMAN-COMPUTER-INTERACTION, MPRSS 2016, 2017, 10183 : 73 - 84
  • [37] Classifying flexible measures in two-stage network DEA and DEA-RA using novel slacks-based models
    Monfared, Seyede Nasrin Hosseini
    Lotfi, Farhad Hosseinzadeh
    Mozaffari, Mohammad Reza
    Malkhalifeh, Mohsen Rostamy
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2024, 46 (01) : 2233 - 2259
  • [38] A primal-dual method for approximating tree cover with two weights
    Doi, Takashi
    Fujito, Toshihiro
    [J]. DISCRETE OPTIMIZATION, 2006, 3 (03) : 230 - 237
  • [39] Two efficient primal-dual algorithms for MRI Rician denoising
    Martin, A.
    Garamendi, J. F.
    Schiavi, E.
    [J]. COMPUTATIONAL MODELLING OF OBJECTS REPRESENTED IN IMAGES: FUNDAMENTALS, METHODS AND APPLICATIONS III, 2012, : 291 - 296
  • [40] Two-stage DEA models with fairness concern: Modelling and computational aspects
    Wu, Jie
    Xu, Guangcheng
    Zhu, Qingyuan
    Zhang, Chaochao
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 105