On the completeness and constructiveness of parametric characterizations to vector optimization problems

  title={On the completeness and constructiveness of parametric characterizations to vector optimization problems},
  author={Andrzej P. Wierzbicki},
  • A. Wierzbicki
  • Published 1 June 1986
  • Mathematics
  • Operations-Research-Spektrum
SummaryMotivated by recent reviews of characterizations of optimal solutions to vector optimization problems and by applications to decision support systems, this paper presents a methodological approach to comparing such characterizations. After specifying attributes of constructiveness, alternative classes of characterizations are reviewed. Characterization theorems are quoted or presented in more detail in cases that supplement those given in recent reviews. One of alternative classes of… 

Some remarks on the vector optimization method of fandel

SummaryThe paper investigates properties of the normal vectors of hyperplanes, applied in the interactive vector optimization method of Fandel. This work was inspirated by a numeric example of

Decisions with uncertain alternatives

Abstract. This paper analyses decision models with an uncertain set of alternatives defined by a deterministic objective function and constraints with uncertain coefficients. Here, in contrast to

Scalarization in set optimization with solid and nonsolid ordering cones

An axiomatic approach based on general order representation and order preservation properties is followed, which works in any abstract set ordered by a quasi order, and a recent Gerstewitz scalarization mapping for set-valued optimization problems with proper sets and a solid ordering cone is studied.

Domination and decomposition in multiobjective programming

During the last few decades, multiobjective programming has received much attention for both its numerous theoretical advances as well as its continued success in modeling and solving real-life

A scalarization scheme for binary relations with applications to set-valued and robust optimization

A new robustness concept in optimization under uncertainty is introduced which is interesting in itself and applied both to characterize by scalarization approximate solutions of set optimization problems with set ordering and to generalize some recent conditions on robust solutions of optimization problems.

On Approximate Solutions in Vector Optimization Problems Via Scalarization

Through scalarization, characterizations and parametric representations for the set of approximate solutions in convex and nonconvex vector optimization problems are proved and the obtained results are applied to Pareto problems.

Nonlinear Multiobjective Programming

This introductory treatment of the theory and methodology of nonlinear multiobjective programming offers an annotated bibliographic overview of various concepts and approaches to solve continuous

Exact and approximate solving approaches in multi-objective combinatorial optimization, application to the minimum weight spanning tree problem. (Approches de résolution exacte et approchée en optimisation combinatoire multi-objectif, application au problème de l'arbre couvrant de poids minimal)

This thesis deals with several aspects related to solving multi-objective problems, without restriction to the bi-objectives, and proposes a new hybrid approach for the determination of the nondominated set, which is instantiated on the minimum spanning tree problem.

Interactive Robust Cone Contraction Method for Multiple Objective Optimization Problems

We introduce a new interactive procedure for multiple objective optimization problems. The identification of the most preferred solution is achieved by means of a systematic dialogue with the



Some characterizations of the optimal solutions of a vector optimization problem

SummaryIn this paper several kinds of optima of a vector optimization problem are investigated; these are minimal, weakly minimal, strongly minimal and properly minimal solutions. For these optima

Existence of efficient solutions for vector maximization problems

The vector maximization problem arises when more than one objective function is to be maximized over a given feasibility region. The concept of efficiency has played a useful role in analyzing this

Über einen Lösungsansatz zum Vektormaximumproblem

Das Vektormaximumproblem, interpretiert als Problem mehrfacher Zielsetzung, ist von sehr allgemeiner Bedeutung. Fast jeder Mensch steht taglich in Situationen, in denen er sich fur eine von mehreren

Optimale Entscheidung bei mehrfacher Zielsetzung

Die vorliegende Arbeit behandelt ein aktuelles Thema der Entschei dungstheorie: die Frage nach der optimalen Entscheidung bei mehr facher Zielsetzung. Mit mehrfachen Zielsetzungen setzte sich zu erst

A Visual Interactive Method for Solving the Multiple-Criteria Problem

An interactive weighted Tchebycheff procedure for multiple objective programming

The procedure samples the efficient set by computing the nondominated criterion vector that is closest to an ideal criterion vector according to a randomly weighted Tchebycheff metric. Using