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

DOI10.1007/BF01719738zbMath0592.90084WikidataQ29541508 ScholiaQ29541508MaRDI QIDQ1075949

Andrzej P. Wierzbicki

Publication date: 1986

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

vector optimizationdecision support systemsaspiration levelscharacterizations of optimal solutionsorder-consistent achievement functions

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50)

Related Items (only showing first 100 items - show all)

ANOVA-MOP: ANOVA Decomposition for Multiobjective Optimization ⋮ Nonlinear scalarization in multiobjective optimization with a polyhedral ordering cone ⋮ Solving a linear multiperiod portfolio problem by interior-point methodology ⋮ A new scheme for approximating the weakly efficient solution set of vector rational optimization problems ⋮ Approximation of Weak Efficient Solutions in Vector Optimization ⋮ Multiobjective Programming and Multiattribute Utility Functions in Portfolio Optimization ⋮ Cone contraction method with visual interaction for multiple‐objective non‐linear programmes ⋮ Characterization of substantially and quasi-substantially efficient solutions in multiobjective optimization problems ⋮ Solving scalarized multi-objective network flow problems using an interior point method ⋮ Symmetric duality theory for linear goal programming ⋮ MCDA and preference disaggregation in group decision support systems. ⋮ Unnamed Item ⋮ Convexification of a noninferior frontier ⋮ The Need for and Possible Methods of Objective Ranking ⋮ Algorithmical approaches to business process design ⋮ Interactive reference direction approach using implicit parametrization for nonlinear multiobjective optimization ⋮ The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems ⋮ Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory ⋮ Application of Evolutionary Algorithms for Solving Multi-Objective Simulation Optimization Problems ⋮ Unnamed Item ⋮ Approximation of the efficient point set by perturbation of the ordering cone ⋮ Unnamed Item ⋮ An application of interactive multi-criteria optimization to air pollution control ⋮ ε-approximate solutions in multiobjective optimization ⋮ A new efficiently encoded multiobjective algorithm for the solution of the cardinality constrained portfolio optimization problem ⋮ Out of the mist -- towards decision-maker-friendly multiple criteria decision making support ⋮ On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study ⋮ Estimating aspiration levels from discrete choices -- computational techniques and experiences ⋮ Unified interactive multiple objective programming ⋮ Strongly proper efficient solutions: efficient solutions with bounded trade-offs ⋮ A goal programming model of the reference point method ⋮ Vector optimization and generalized Lagrangian duality ⋮ Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components ⋮ A discussion of scalarization techniques for multiple objective integer programming ⋮ Ordered weighted enhancement of preference modeling in the reference point method for multiple criteria optimization ⋮ MOLP with an interactive assessment of a piecewise linear utility function ⋮ A multi-objective interactive system for adaptive traffic control ⋮ Use of exact penalty functions to determine efficient decisions ⋮ Design of a heuristic algorithm for the generalized multi-objective set covering problem ⋮ LR-NIMBUS: an interactive algorithm for uncertain multiobjective optimization with lightly robust efficient solutions ⋮ Optimistic NAUTILUS navigator for multiobjective optimization with costly function evaluations ⋮ Families of differentiable scalarization functions ⋮ On approximate efficiency in multiobjective programming ⋮ An efficient procedure for finding best compromise solutions to the multi-objective assignment problem ⋮ An interactive algorithm to find the most preferred solution of multi-objective integer programs ⋮ On approximate solutions in vector optimization problems via scalarization ⋮ Efficient solutions and bounds on tradeoffs ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ Constrained optimization using multiple objective programming ⋮ Using a Choquet integral-based approach for incorporating decision-maker's preference judgments in a data envelopment analysis model ⋮ Use of reference points for solving MONLP problems ⋮ A reference direction approach to multiple objective integer linear programming ⋮ Computing representations using hypervolume scalarizations ⋮ A synchronous reference point-based interactive method for stochastic multiobjective programming ⋮ Trade-off analysis approach for interactive nonlinear multiobjective optimization ⋮ An application of a multi-objective programming technique to construction accuracy control of cable-stayed bridges ⋮ A new preference handling technique for interactive multiobjective optimization without trading-off ⋮ Reference point method with importance weighted ordered partial achievements ⋮ Incorporating wealth information into a multiple criteria decision making model ⋮ Nonlinear multicriteria clustering based on multiple dissimilarity matrices ⋮ Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem ⋮ Global formulation for interactive multiobjective optimization ⋮ Lexicographic extension of the reference point method applied in radiation therapy treatment planning ⋮ Bi-objective optimization problems with two decision makers: refining Pareto-optimal front for equilibrium solution ⋮ A new achievement scalarizing function based on parameterization in multiobjective optimization ⋮ The interactive analysis of the multicriteria shortest path problem by the reference point method. ⋮ Computation of ideal and Nadir values and implications for their use in MCDM methods. ⋮ Comparing reference point based interactive multiobjective optimization methods without a human decision maker ⋮ Modelling as a way of organising knowledge ⋮ Interactive \textsc{Nonconvex Pareto Navigator} for multiobjective optimization ⋮ Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems ⋮ Decision making with multiple objectives using GAI networks ⋮ Preference-based English reverse auctions ⋮ Retrieval and use of the balance set in multiobjective global optimization ⋮ A cutting-plane method to nonsmooth multiobjective optimization problems ⋮ Relocation problems arising in conservation biology ⋮ Exact generation of epsilon-efficient solutions in multiple objective programming ⋮ Incorporating preference information in a range directional composite indicator: the case of portuguese public hospitals ⋮ The global weak sharp minima with explicit exponents in polynomial vector optimization problems ⋮ Optimality conditions for metrically consistent approximate solutions in vector optimization ⋮ Multi-objective geometric programming problem with \(\epsilon\)-constraint method ⋮ Measuring systems sustainability with multi-criteria methods: a critical review ⋮ Trade-off analysis using parametric optimization techniques ⋮ A unified approach to uncertain optimization ⋮ Reference points and approximation algorithms in multicriteria discrete optimization ⋮ Trade-off preservation in inverse multi-objective convex optimization ⋮ Constructing a Pareto front approximation for decision making ⋮ PAINT: Pareto front interpolation for nonlinear multiobjective optimization ⋮ Improving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithm ⋮ Modified interactive Chebyshev algorithm (MICA) for non-convex multiobjective programming ⋮ A two-slope achievement scalarizing function for interactive multiobjective optimization ⋮ On chance maximization model in fuzzy random decision systems ⋮ Reference point approach for multiple decision makers ⋮ A preference-based approach to spanning trees and shortest paths problems ⋮ Pareto navigator for interactive nonlinear multiobjective optimization ⋮ Scalarization in set optimization with solid and nonsolid ordering cones ⋮ A scalarization scheme for binary relations with applications to set-valued and robust optimization ⋮ On the extension of the \textsc{direct} algorithm to multiple objectives ⋮ On Efficient Solutions with Trade-Offs Bounded by Given Values ⋮ Decision making in multiobjective optimization problems under uncertainty: balancing between robustness and quality

Cites Work

• Some characterizations of the optimal solutions of a vector optimization problem
• Theory of multiobjective optimization
• Proper efficiency with respect to cones
• Vector-valued optimization problems in control theory. Transl. from the Russian by John L. Casti
• Characterization of properly efficient solutions by generalized scalarization methods
• Compromise solutions, domination structures, and Salukvadze's solution
• Existence of efficient solutions for vector maximization problems
• Goal programming and multiple objective optimizations. Part I
• Proper efficiency and the theory of vector maximization
• Optimale Entscheidung bei mehrfacher Zielsetzung
• The Bargaining Problem
• Scalarization in vector optimization
• A mathematical basis for satisficing decision making
• Interactive Sequential Goal Programming
• Other Solutions to Nash's Bargaining Problem
• An Interactive Programming Method for Solving the Multiple Criteria Problem
• An interactive weighted Tchebycheff procedure for multiple objective programming
• Interactive Goal Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the completeness and constructiveness of parametric characterizations to vector optimization problems