A method to solve r-inverse DEA problem
Yu Peng
Abstract
Yu Peng
Abstract
The DMU with inputs increased,and its efficiency level became r times to primal level, how much more outputs could the unit produce,such problem was called r-inverse DEA problem in this paper.It is the extension of general inverse DEA problem.By constructing two special linear programming models,an approach to get a kind of solution for r-inverse DEA problem had been ob- tained,with the illustration by a numerical example.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The DMU with inputs increased,and its efficiency level became r times to primal level, how much more outputs could the unit produce,such problem was called r-inverse DEA problem in this paper.It is the extension of general inverse DEA problem.By constructing two special linear programming models,an approach to get a kind of solution for r-inverse DEA problem had been ob- tained,with the illustration by a numerical example.
Key concepts: Inverse, Extension (predicate logic), Inverse problem, Mathematical optimization, Linear programming, Mathematics, Unit (ring theory), Computer science