A survey of recent developments in multiobjective optimization
From MaRDI portal
Publication:2468335
DOI10.1007/S10479-007-0186-0zbMath1146.90060OpenAlexW1990023680MaRDI QIDQ2468335
Panos M. Pardalos, Altannar Chinchuluun
Publication date: 22 January 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0186-0
Related Items (only showing first 100 items - show all)
Optimizing a linear fractional function over the integer efficient set ⋮ Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems ⋮ Optimizing over the properly efficient set of convex multi-objective optimization problems ⋮ Optimality and duality in nonsmooth composite vector optimization and applications ⋮ Solving multi-objective integer indefinite quadratic fractional programs ⋮ SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics ⋮ A redistricting problem applied to meter reading in power distribution networks ⋮ Direct zigzag search for discrete multi-objective optimization ⋮ Optimality conditions in quasidifferentiable vector optimization ⋮ Normal subdifferentials of efficient point multifunctions in parametric vector optimization ⋮ Symmetric duality for second-order fractional programs ⋮ Stability of multiobjective predictive control: A utopia-tracking approach ⋮ Credibility-based biobjective fuzzy optimization for supplier selection problem with disruption ⋮ The density maximization problem in graphs ⋮ Optimality of \(E\)-pseudoconvex multi-objective programming problems without constraint qualifications ⋮ Minimization of vectors of curvilinear functionals on the second order jet bundle: sufficient efficiency conditions ⋮ Interactive multiobjective optimization approach to the input-output design of opening new branches ⋮ Duality for nondifferentiable multiobjective higher-order symmetric programs over cones involving generalized \((F,{\alpha},{\rho},d)\)-convexity ⋮ Second order sufficient optimality conditions in vector optimization ⋮ Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency ⋮ On the worst-case optimal multi-objective global optimization ⋮ A generalized computing paradigm based on artificial dynamic models for mathematical programming ⋮ Efficient multi-objective tabu search for emergency equipment maintenance scheduling in disaster rescue ⋮ Optimality via generalized approximate convexity and quasiefficiency ⋮ On stability of multiobjective NMPC with objective prioritization ⋮ On efficient applications of \(G\)-Karush-Kuhn-Tucker necessary optimality theorems to multiobjective programming problems ⋮ Second-order multiobjective symmetric duality involving cone-bonvex functions ⋮ Minimization of vectors of curvilinear functionals on second-order jet bundle: dual program theory ⋮ Characterizing strict efficiency for convex multiobjective programming problems ⋮ A logarithmic-quadratic proximal point scalarization method for multiobjective programming ⋮ A generic approach to approximate efficiency and applications to vector optimization with set-valued maps ⋮ A fast steady-state \(\varepsilon \)-dominance multi-objective evolutionary algorithm ⋮ Multi-objective retrospective optimization using stochastic zigzag search ⋮ Sufficient efficiency conditions for vector ratio problem on the second-order jet bundle ⋮ On vector variational-like inequalities and set-valued optimization problems ⋮ Nondifferentiable multiobjective second-order symmetric duality ⋮ Optimality conditions in terms of Bouligand derivatives for Pareto efficiency in set-valued optimization ⋮ A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death ⋮ Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems ⋮ A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming ⋮ Generalized Minty vector variational-like inequalities and vector optimization problems in Asplund spaces ⋮ Improving fleet utilization for carriers by interval scheduling ⋮ On sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \(V-r\)-invex functions ⋮ Vectorization of set-valued maps with respect to total ordering cones and its applications to set-valued optimization problems ⋮ Duality theorems for a new class of multitime multiobjective variational problems ⋮ Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming ⋮ A characterization of super efficiency in vector equilibrium problems ⋮ Infinite-horizon multiobjective optimal control problems for bounded processes ⋮ Vector optimization problems via improvement sets ⋮ A multiobjective optimization algorithm based on discrete bacterial colony chemotaxis ⋮ A multi-criteria optimization model for humanitarian aid distribution ⋮ Pareto-optimality of oblique decision trees from evolutionary algorithms ⋮ An intelligent multi-criteria optimization method for quick and market-oriented textile material design ⋮ Vector optimization problem and generalized convexity ⋮ Weak efficiency in multiobjective variational problems under generalized convexity ⋮ Calmness of efficient solution maps in parametric vector optimization ⋮ Generalized higher-order cone-convex functions and higher-order duality in vector optimization ⋮ Computing multiobjective Markov chains handled by the extraproximal method ⋮ Wolfe type higher order multiple objective nondifferentiable symmetric dual programming with generalized invex function ⋮ Modeling and solving the bi-objective minimum diameter-cost spanning tree problem ⋮ Pareto-optimal front of cell formation problem in group technology ⋮ Fast approximation algorithms for routing problems with hop-wise constraints ⋮ Logarithmic quasi-distance proximal point scalarization method for multi-objective programming ⋮ A class of nonsmooth fractional multiobjective optimization problems ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ Efficient multicriterial optimization based on intensive reuse of search information ⋮ Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs ⋮ Minimization of vectors of curvilinear functionals on the second-order jet bundle ⋮ A new complexity result on multiobjective linear integer programming using short rational generating functions ⋮ Higher-order duality in vector optimization over cones ⋮ Classical linear vector optimization duality revisited ⋮ On linear vector program and vector matrix game equivalence ⋮ Nonsmooth \(\rho - (\eta , \theta )\)-invexity in multiobjective programming problems ⋮ Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming ⋮ Sensitivity and stability for the second-order contingent derivative of the proper perturbation map in vector optimization ⋮ Complexity of necessary efficiency in interval linear programming and multiobjective linear programming ⋮ On Lagrangian duality in vector optimization: applications to the linear case ⋮ An optimum multivariate stratified double sampling design in presence of non-response ⋮ Bees algorithm for constrained fuzzy multi-objective two-sided assembly line balancing problem ⋮ Common best proximity points: global minimization of multi-objective functions ⋮ Inner and outer estimates for the solution sets and their asymptotic cones in vector optimization ⋮ Attractive force search algorithm for piecewise convex maximization problems ⋮ An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem ⋮ Improving the computational efficiency in a global formulation (GLIDE) for interactive multiobjective optimization ⋮ Scalarization and pointwise well-posedness in vector optimization problems ⋮ Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems ⋮ Second order duality for nondifferentiable multiobjective programming problem involving \((F, \alpha , \rho , d)-V\)-type I functions ⋮ Nondifferentiable multiobjective Mond-Weir type second-order symmetric duality over cones ⋮ On constructing total orders and solving vector optimization problems with total orders ⋮ An approximation algorithm for convex multi-objective programming problems ⋮ Multiobjective model predictive control ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ Characterizations of efficient and weakly efficient points in nonconvex vector optimization ⋮ Two-stage multiobjective optimization for emergency supplies allocation problem under integrated uncertainty ⋮ Global optimization based on active preference learning with radial basis functions ⋮ The generalization of total ordering cones and vectorization to separable Hilbert spaces ⋮ Optimality conditions for vector optimization problems ⋮ A novel multi-objective approach for link selection in aeronautical telecommunication networks ⋮ Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Efficient spanning trees
- On duality theory in multiobjective programming
- Theory of multiobjective optimization
- An algorithm for the bi-criterion integer programming problem
- The shortest path problem with two objective functions
- Duality for nonlinear multiple-criteria optimization problems
- On sufficiency of the Kuhn-Tucker conditions
- An algorithm for the multiple objective integer linear programming problem
- On efficiency and duality for multiobjective programs
- Duality theory in multiobjective programming
- Efficiency and generalized convex duality for multiobjective programs
- Symmetric dual multiobjective programming
- Financial modelling: Where to go? With an illustration for portfolio management
- Nonlinear multiobjective optimization
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- On spanning tree problems with multiple objectives
- On ratio invexity in mathematical programming
- Efficiency and generalized concavity
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Multiple criteria decision making combined with finance: a categorized bibliographic study.
- Efficiency conditions and duality for a class of multiobjective fractional programming problems
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Nonlinear multiobjective optimization. A generalized homotopy approach
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- A characterization of weakly efficient points
- The problem of the optimal biobjective spanning tree
- Genetic algorithm approach on multi-criteria minimum spanning tree problem
- An empirical investigation of some bicriterion shortest path algorithms
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions
- Integer programming duality in multiple objective programming
- Duality in nonlinear multiobjective programming using augmented Lagrangian functions
- Advances in multicriteria analysis
- Some results on mathematical programming with generalized ratio invexity
- A label correcting approach for solving bicriterion shortest-path problems
- Time dependency in multiple objective dynamic programming
- Proper efficiency and the theory of vector maximization
- Strong and Weak Convexity of Sets and Functions
- A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1
- Linear Optimal Designs and Optimal Contingency Plans
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
- Theory and algorithms for linear multiple objective programs with zero–one variables
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
- Multiobjective fractional programming duality theory
- Second-order necessary and sufficient conditions in multiobjective programming∗
- On generalised convex mathematical programming
- Linear multiple objective programs with zero–one variables
- Parametric Solution for Linear Bicriteria Knapsack Models
- A multi‐criterion approach for selecting attractive portfolio
- Multi‐objective combinatorial optimization problems: A survey
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Generalized invexity and duality in multiobjective programming problems
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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: A survey of recent developments in multiobjective optimization