A method for solving 0-1 multiple objective programming problem, using data envelopment analysis technique (Q928617)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A method for solving 0-1 multiple objective programming problem, using data envelopment analysis technique |
scientific article; zbMATH DE number 5287448
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A method for solving 0-1 multiple objective programming problem, using data envelopment analysis technique |
scientific article; zbMATH DE number 5287448 |
Statements
A method for solving 0-1 multiple objective programming problem, using data envelopment analysis technique (English)
0 references
11 June 2008
0 references
Summary: In this paper a method for finding efficient solutions of a 0-1 multiple objective linear (nonlinear) programming problem using data envelopment analysis (DEA) technique is proposed. In this method, for each feasible solution of 0-1 multiple objective programming (0-1 MOP) problem, a decision making unit (DMU) is introduced. Using the additive model, the relative efficiency of these DMUs is evaluated. Each feasible solution corresponding to an efficient DMU is the efficient solution of 0-1 MOP problem.
0 references
0-1 multiple objective programming
0 references
data envelopment analysis
0 references
efficient solution
0 references
0.9419146180152892
0 references
0.8357473611831665
0 references
0.8178256750106812
0 references
