On the Construction of Strong Complementarity Slackness Solutions for DEA Linear Programming Problems Using a Primal-Dual Interior-Point Method

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 28, 1994
Accession Number
ADA444967

Entities

People

  • Maria D. Gonzalez-lima
  • Richard A. Tapia
  • Robert M. Thrall

Organizations

  • Rice University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Applied Mathematics
  • Computer Programming
  • Construction
  • Contracts
  • Information Operations
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research

Readers

  • Operations Research