An effective approach to decision support in multicriteria decision making (MCDM) problems characterized by three to eight decision criteria is described. The approach is based on approximating the feasible set in the criterion space (or a broader criterion set, which has the same Pareto frontier) and visualization of the Pareto frontier by interactive displaying bi-criterion slices of this set...

This paper reports an evolutionary approach called Scatter Search, that uses the concept of Pareto optimality to obtain a good approximate Pareto frontier. In order to designate a subset of strategies to be a reference solutions a choice function called Kramer Selection is used. A variant of measure of Kemen-Snell may be used, in our case study, in order to find a diverse set to complement the ...

Many designers concede that there is typically more than one measure of performance for an artifact. Often, a large system is decomposed into smaller subsystems each having its own set of objectives, constraints, and parameters. The performance of the final design is a function of the performances of the individual subsystems. It then becomes necessary to consider the tradeoffs that occur in a ...

Many real-world applications are characterized by multiple conflicting objectives. In such problems optimality is replaced by Pareto optimality and the goal is to find the Pareto frontier, a set of solutions representing different compromises among the objectives. Despite recent advances in multi-objective optimization, achieving an accurate representation of the Pareto frontier is still an imp...

Marcet and Marimon (1994, revised 1998) developed a recursive saddle point method which can be used to solve dynamic contracting problems that include participation, enforcement and incentive constraints. Their method uses a recursive multiplier to capture implicit prior promises to the agent(s) that were made in order to satisfy earlier instances of these constraints. As a result, their method...

The notion of Pareto-optimality is one of the major approaches to multiobjective programming. While it is desirable to find more Pareto-optimal solutions, it is also desirable to find the ones scattered uniformly over the Pareto frontier in order to provide a variety of compromise solutions to the decision maker. In this paper, we design a genetic algorithm for this purpose. We compose multiple...

In bilateral Negotiation Analysis, the literature often considers the case of complete information. In this context, since the negotiators know the value functions of both parties, it is not difficult to calculate the Pareto frontier and the Pareto efficient solutions for the negotiation. Thus rational negotiators can reach agreement on this frontier. However, these approaches are not applied i...

The Hyper-Space Diagonal Counting (HSDC) method was previously proposed for generating representations of n-dimensional data in 2or 3-dimensions. Since its inception, the HSDC has been used to visualize the n-dimensional performance space in an intuitive fashion for Multiobjective Optimization Applications, through the incorporation of the HSDC into the Hyperspace Pareto Frontier (HPF) visualiz...

We study the Pareto frontier for two competing norms ‖ · ‖X and ‖ · ‖Y on a vector space. For a given vector c, the Pareto frontier describes the possible values of (‖a‖X , ‖b‖Y ) for a decomposition c = a + b. The singular value decomposition of a matrix is closely related to the Pareto frontier for the spectral and nuclear norm. We will develop a general theory that extends the notion of sing...

Real life problems involve seldom only one criterion, but multiple criteria should be optimised at the same time. The criteria can even be conflicting each other, so the classical techniques used in single criteria optimization cannot be simply reused. Many ideas have been presented in the literature for addressing multiple criteria optimization problems; one of the ideas is to provide the so-c...