In this paper, possibilistic linear programming problems are investigated. After reviewing relations among conjunction and implication functions, necessity fractile optimization models with various implication functions are applied to the possibilistic linear problems. We show that the necessity fractile optimization models are reduced to semi-infinite linear programming problems. A simple nume...

Possibilistic decision theory has been proposed twenty years ago and has had several extensions since then. Because of the lack of decision power of possibilistic decision theory, several refinements have then been proposed. Unfortunately, these refinements do not allow to circumvent the difficulty when the decision problem is sequential. In this article, we propose to extend lexicographic refi...

We deal with DNA combinatorial code constructions, as found in the literature, taking the point of view of possibilistic information theory and possibilistic coding theory. The possibilistic framework allows one to tackle an intriguing information-theoretic question: what is channel noise in molecular computation? We examine in detail two representative DNA string distances used for DNA code co...

Fuzzy data given by expert knowledge can be regarded as a possibility distribution by which possibilistic linear systems are defined. Recently, it has become important to deal with fuzzy data in connection with expert knowledge. Three formulations of possibilistic linear regression analysis are proposed here to deal with fuzzy data. Since our formulations can be reduced to linear programming pr...

Vast pools of historical financial information are available on economies, industry, and individual companies that affect investors’ selection of appropriate portfolios. Fuzzy data provides a good tool to reflect investors’ opinions based on this information. A possibilistic mean variance safety-first portfolio selection model is developed to support investors’ decision making, to take into con...

In current research, a possibilistic, hierarchical approach for identification of co-referent objects (also called object matching) has been proposed as a generalisation of the record linkage problem. This approach offers a natural view to the matching of co-referent objects and uses logical possibilistic operators to calculate a final result. The development of evaluation operators, to deliver...