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
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
A Convergent Approximation of the Pareto Optimal Set for Finite Horizon Multiobjective Optimal Control Problems (MOC) Using Viability Theory [PDF]
, 2012 The objective of this paper is to provide a convergent numerical approximation of the Pareto optimal set for finite-horizon multiobjective optimal control problems for which the objective space is not necessarily convex.
Guigue, A.
core
Well-posed Vector Optimization Problems and Vector Variational Inequalities [PDF]
In this paper we introduce notions of well-posedness for a vector optimization problem and for a vector variational inequality of differential type, we study their basic properties and we establish the links among them.
Rocca Matteo
core
The tolerance approach in multiobjective linear fractional programming [PDF]
, 1997 When solving a multiobjective programming problem by the weighted sum ap- proach, weights represent the relative importance associated to the objectives.
Arévalo Quijada, María Teresa +2 more
core
, 2014 Information theoretical inequalities have strong ties with polymatroids and their representability. A polymatroid is entropic if its rank function is given by the Shannon entropy of the subsets of some discrete random variables.
Csirmaz, Laszlo
core +1 more source
On the Necessity of the Sufficient Conditions in Cone-Constrained Vector Optimization [PDF]
, 2014 The object of investigation in this paper are vector nonlinear programming problems with cone constraints. We introduce the notion of a Fritz John pseudoinvex cone-constrained vector problem.
Ivanov, Vsevolod I.
core
On Lagrangian Duality in Vector Optimization. Applications to the linear case. [PDF]
The paper deals with vector constrained extremum problems. A separation scheme is recalled; starting from it, a vector Lagrangian duality theory is developed. The linear duality due to Isermann can be embedded in this separation approach.
Elisa Pagani
core
PC Points and their Application to Vector Optimization [PDF]
, 1998 AMS subject classification: 90C29, 90C48In this paper we present some results concerning stability under perturbations and some topological properties of minimal point sets in vector optimization.
Bednarczuk, Ewa, Song, Wen
core