On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method

DOI10.1007/BF02187298zbMath0868.90001OpenAlexW1985110611MaRDI QIDQ1816897

Richard A. Tapia, María D. González-Lima, Robert M. Thrall

Publication date: 4 August 1997

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02187298

zbMATH Keywords

data envelopment analysisprimal-dual interior-point methodanalytic center of the solution setstrong complementarity slackness condition

Mathematics Subject Classification ID

Decision theory (91B06) Linear programming (90C05)

Related Items (10)

A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming ⋮ On central-path proximity measures in interior-point methods ⋮ Measurement of returns to scale using a non-radial DEA model: a range-adjusted measure approach ⋮ Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution ⋮ Multiparametric sensitivity analysis of the additive model in data envelopment analysis ⋮ Interior point methods in DEA to determine non-zero multiplier weights ⋮ Enhancing the behavior of interior-point methods via identification of variables ⋮ Duality, classification and slacks in DEA ⋮ DEA multiplier analytic center sensitivity with an illustrative application to independent oil companies ⋮ DEA/AR profit ratios and sensitivity of 100 large U. S. banks

Cites Work

• Classifying and characterizing efficiencies and inefficiencies in data development analysis
• An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
• DEA multiplier analytic center sensitivity with an illustrative application to independent oil companies
• Path-Following Methods for Linear Programming
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
• State Constraints in Convex Control Problems of Bolza
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method