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

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

0.00 Avg rating0 Votes
Article ID: iaor19971678
Country: Netherlands
Volume: 66
Issue: 1
Start Page Number: 139
End Page Number: 162
Publication Date: Aug 1996
Journal: Annals of Operations Research
Authors: , ,
Abstract:

A novel approach for solving the DEA linear programming problems using a primal-dual interior-point method is presented. The solution found by this method satisfies the Strong Complementarity Slackness Condition (SCSC) and maximizes the product of the positive components among all SCSC solutions. The first property is critical in the use of DEA and the second one contributes significantly to the reliability of the solution.

Reviews

Required fields are marked *. Your email address will not be published.