On Characterizations of Proper Efficiency for Nonconvex Multiobjective Optimization

In this paper, nonconvex multiobjective optimization problems are studied. New characterizations of a properly efficient solution in the sense of Geoffrion's are established in terms of the stability of one scalar optimization problem and the existence of an exact penalty function of a scalar constrained program, respectively. One of the characterizations is applied to derive necessary conditions for a properly efficient control-parameter pair of a nonconvex multiobjective discrete optimal control problem with linear constraints.     

New indices for analysing partial ranking diagrams

Interest is growing in decision making strategies and several techniques are now available. The assessment of priorities is a typical premise before final decisions are taken. Total and partial order ranking (POR) strategies, which from a mathematical point of view are based on elementary methods of discrete mathematics, appear as an attractive and simple tool to asses priorities. Despite the well-known total ranking strategies, which are scalar methods combining the different criteria values into a global index which always ranks elements in an ordered sequence, the partial order ranking is a vectorial approach which recognises that not all the elements can be directly compared with all the others. In fact when many criteria are considered, contradictions in the ranking are bound to exist and the higher the number of criteria, the higher the probability that contradictions in the ranking occur. The Hasse diagram technique (HDT) is a very useful tool to perform partial order ranking. The results of the partial order ranking are visualised in a diagram, called Hasse diagram. Incomparable elements are located at the same geometrical height and as high as possible in the diagram, thus incomparable elements are arranged in levels. The quality of a ranking procedure has to be evaluated by a deep analysis and by several indices, i.e. scalar functions that describe features of an ordered set and allow comparison among different rankings. For this purpose, new indices for ranking analysis are proposed here, compared with the ones found in literature and tested on theoretical examples and on real data.     

Development of a multicriteria assessment model for ranking biomass feedstock collection and transportation systems

This study details multicriteria assessment methodology that integrates economic, social, environmental, and technical factors in order to rank alternatives for biomass collection and transportation systems. Ranking of biomass collection systems is based on cost of delivered biomass, quality of biomass supplied, emissions during collection, energy input to the chain operations, and maturity of supply system technologies. The assessment methodology is used to evaluate alternatives for collecting 1.8×10⁶ dry t/yr based on assumptions made on performance of various assemblies of biomass collection systems is based on cost of delivered biomass, quality of biomass supplied, emissions during collection, energy input to the chain operations, and maturity of supply system technologies. The assessment methodology is used to evaluate alternatives for collecting 1.8×10⁶ dry t/yr based on assumptions made on performance of various assemblies of biomass collection systems. A proposed collection option using loafer/stacker was shown to be the best option followed by ensiling and baling. Ranking of biomass transport systems is based on cost of biomass transport, emissions during transport, traffic congestion, and maturity of different technologies. At a capacity of 4×10⁶ dry t/yr, rail transport was shown to be the best option, followed by truck transport and pipeline transport, respectively. These rankings depend highly on assumed maturity of technologies and scale of utilization. These may change if technologies such as loafing or ensiling (wet storage) methods are proved to be infeasible for large-scale collection systems.     

An overview on available models and techniques for the multicriteria reliability problem with emphasis on a potential use in a DSS for this problem type

The paper reviews available models and techniques covering three classes of the multi-criteria reliability problem. These classes include allocation of reliabilities in presence of multiple goals, reliability optimization with several kinds of failures and allocation of resources to optimize multiattribute systems. Optimization techniques are also suggested. The models and techniques are also evaluated with respect to their potential use in a DSS for reliability optimization.     

Multicriteria decision-making method using the Dice similarity measure based on the reduct intuitionistic fuzzy sets of interval-valued intuitionistic fuzzy sets

This paper proposes the concept of the reduct intuitionistic fuzzy sets of interval-valued intuitionistic fuzzy sets (IVIFSs) with respect to adjustable weight vectors and the Dice similarity measure based on the reduct intuitionistic fuzzy sets to explore the effects of optimism, neutralism, and pessimism in decision making. Then a decision-making method with the pessimistic, optimistic, and neutral schemes desired by the decision maker is established by combining adjustable weight vectors and the Dice similarity measure for IVIFSs. The proposed decision-making method is more flexible and adjustable in practical problems and can determine the ranking order of alternatives and the optimal one(s), so that it can overcome the difficulty of the ranking order and decision making when there exist the same measure values of some alternatives in some cases. This adjustable feature can provide the decision maker with more selecting schemes and actionable results for the decision-making analysis. Finally, two illustrative examples are employed to show the feasibility of the proposed method in practical applications.     

On the calculation of a membership function for the solution of a fuzzy linear optimization problem

In the present paper the fuzzy linear optimization problem (with fuzzy coefficients in the objective function) is considered. Recent concepts of fuzzy solution to the fuzzy optimization problem based on the level-cut and the set of Pareto optimal solutions of a multiobjective optimization problem are applied. Chanas and Kuchta suggested one approach to determine the membership function values of fuzzy optimal solutions of the fuzzy optimization problem, which is based on calculating the sum of lengths of certain intervals. The purpose of this paper is to determine a method for realizing this idea. We derive explicit formulas for the bounds of these intervals in the case of triangular fuzzy numbers and show that only one interval needs to be considered.     

Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem

In this article we consider the boolean optimization problem of finding the set of Pareto optimal solutions. The vector objectives are the positive cuts of linear functions to the non-negative semi-axis. Initial data are subject to perturbations, measured by the l ₁-norm in the parameter space of the problem. We present the formula expressing the extreme level (stability radius) of such perturbations, for which a particular solution remains Pareto optimal.     

Multicriteria analysis in decision making under information uncertainty

This paper presents results of research related to multicriteria decision making under information uncertainty. The Bellman–Zadeh approach to decision making in a fuzzy environment is utilized for analyzing multicriteria optimization models (X,M models) under deterministic information. Its application conforms to the principle of guaranteed result and provides constructive lines in obtaining harmonious solutions on the basis of analyzing associated maxmin problems. This circumstance permits one to generalize the classic approach to considering the uncertainty of quantitative information (based on constructing and analyzing payoff matrices reflecting effects which can be obtained for different combinations of solution alternatives and the so-called states of nature) in monocriteria decision making to multicriteria problems. Considering that the uncertainty of information can produce considerable decision uncertainty regions, the resolving capacity of this generalization does not always permit one to obtain unique solutions. Taking this into account, a proposed general scheme of multicriteria decision making under information uncertainty also includes the construction and analysis of the so-called X,R models (which contain fuzzy preference relations as criteria of optimality) as a means for the subsequent contraction of the decision uncertainty regions. The paper results are of a universal character and are illustrated by a simple example.     

Counting and enumeration complexity with application to multicriteria scheduling

In this paper we tackle an important point of combinatorial optimisation: that of complexity theory when dealing with the counting or enumeration of optimal solutions. Complexity theory has been initially designed for decision problems and evolved over the years, for instance, to tackle particular features in optimisation problems. It has also evolved, more or less recently, towards the complexity of counting and enumeration problems and several complexity classes, which we review in this paper, have emerged in the literature. This kind of problems makes sense, notably, in the case of multicriteria optimisation where the aim is often to enumerate the set of the so-called Pareto optima. In the second part of this paper we review the complexity of multicriteria scheduling problems in the light of the previous complexity results.Received: November 2004 / Received version: March 2005MSC classification: 90B40, 90C29, 68Q15     

Selection of adequate optimization criteria in chromatographic separations

Computer-assisted optimization of chromatographic separations is still a fruitful activity. In fact, advances in computerized data handling should make the application of systematic optimization strategies much easier. However, in most contemporary applications, the optimization criterion is not considered to be a key issue (Vanbel, J Pharm Biomed, 21:603–610, 1999). In this paper, an update of the importance of selecting adequate criteria in chromatographic separation is presented.