Possible and necessary optimality tests in possibilistic linear programming problems

Inuiguchi M & Sakawa M (1994). Possible and necessary optimality tests in possibilistic linear programming problems. Fuzzy Sets and Systems 67 (1): 29-46. DOI:10.1016/0165-0114(94)90206-2.

Full text not available from this repository.

Abstract

In this paper, two kinds of optimality concepts are introduced into fuzzy linear programming problems in order to discuss the rationality of an obtained solution. One is possible optimality evaluating the possibility degree to which the solution is optimal. The other, the dual concept, is necessary optimality evaluating the necessity degree to which the solution is optimal. When possibility distributions are defined by closed intervals, degrees of possible and necessary optimalities become binary. Necessary and sufficient conditions for possible and necessary optimalities are induced in this case. Extending the results, methods of calculating the degrees of possible and necessary optimalities are proposed. Some numerical examples are given to demonstrate the proposed methods.

Item Type: Article
Uncontrolled Keywords: Linear programming; Possibility measure; Necessity measure optimality; Interval programming
Research Programs: Methodology of Decision Analysis (MDA)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 02:03
Last Modified: 24 Aug 2016 12:48
URI: http://pure.iiasa.ac.at/3891

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313