The proximal point method for locally lipschitz functions in multiobjective optimization with application to the compromise problem [PDF]
, 2018 This paper studies the constrained multiobjective optimization problem of finding Pareto critical points of vector-valued functions. The proximal point method considered by Bonnel, Iusem, and Svaiter [SIAM J. Optim., 15 (2005), pp.
Bento, Glaydston de Carvalho +4 more
core +1 more source
Optimality Conditions for D.C. Vector Optimization Problems under D.C. Constraints [PDF]
, 2004 2000 Mathematics Subject Classification: Primary 90C29; Secondary 49K30.In this paper, we establish necessary optimality conditions and sufficient optimality conditions for D.C. vector optimization problems under D.C. constraints.
Gadhi, N., Metrane, A.
core
Speeding up Martins' algorithm for multiple objective shortest path problems [PDF]
, 2013 The latest transportation systems require the best routes in a large network with respect to multiple objectives simultaneously to be calculated in a very short time.
Audenaert, Pieter +4 more
core +2 more sources
Nonessential Functionals in Multiobjective Optimal Control Problems [PDF]
, 2006 We address the problem of obtaining well-defined criteria for multiobjective optimal control systems. Necessary and sufficient conditions for an optimal control functional to be nonessential are proved. The results provide effective tools for determining
Malinowska, Agnieszka B. +1 more
core +4 more sources
On stability of an optimal situation in a finite cooperative game with a parametric concept of equilibrium (from lexicographic optimality to Nash equilibrium) [PDF]
Computer Science Journal of Moldova, 2005 A parametric concept of equilibrium (principle of optimality) in a finite cooperative game in normal form of several players is introduced. This concept is defined by means of the partition of players into coalitions.
Sergey E. Bukhtoyarov +1 more
doaj
Geometric Duality for Convex Vector Optimization Problems [PDF]
, 2011 Geometric duality theory for multiple objective linear programming problems turned out to be very useful for the development of efficient algorithms to generate or approximate the whole set of nondominated points in the outcome space.
Heyde, Frank
core
Linear discrete-time Pareto-Nash-Stackelberg control problem and principles for its solving [PDF]
Computer Science Journal of Moldova, 2013 A direct-straightforward method for solving linear discrete-time optimal control problem is applied to solve control problem of a linear discrete-time system as a mixture of multi-criteria Stackelberg and Nash games.
Valeriu Ungureanu
doaj
Modelizacion de un DSS para la gestión de productos perecederos [PDF]
, 2001 La gestión de inventarios de productos perecederos ha atraído desde hace tiempo la atención de los investigadores de Dirección de Operaciones. En este artículo se presenta la modelización e implementación de un sistema de apoyo a la toma de decisiones ...
Brío González, Jesús Ángel del +2 more
core +1 more source
ON NECESSARY CONDITIONS FOR EFFICIENCY IN DIRECTIONALLY DIFFERENTIABLE OPTIMIZATION PROBLEMS [PDF]
This paper deals with multiobjective programming problems with in- equality, equality and set constraints involving Dini or Hadamard differentiable func- tions.
Do Van Luu, Manh-Hung Nguyen
core +3 more sources
On quasistability radius of a vector trajectorial problem with a principle of optimality generalizing Pareto and lexicographic principles [PDF]
Computer Science Journal of Moldova, 2005 A multicriterion linear combinatorial problem with a parametric principle of optimality is considered. This principle is defined by a partitioning of partial criteria onto Pareto preference relation groups within each group and the lexicographic ...
Sergey E. Bukhtoyarov +1 more
doaj