Results 11 to 20 of about 5,158 (244)
Generalized Convexity in Multiobjective Programming [PDF]
Journal of Mathematical Analysis and Applications, 1999 For the scalar programming problem, some characterizations for optimal solutions are known. In these characterizations convexity properties play a very important role.
Rufian-Lizana, A. +5 more
core +5 more sources
4.5. Multiobjective programming [PDF]
Energy, 1990 Abstract The work presented in this paper focuses on the introduction of multiobjective programming methods into a large-scale energy systems planning model. We first review several multiobjective techniques, ranging from simple methods aiming at exploring the set of efficient solutions, to complex interactive algorithms providing best compromise ...
Samouilidis, J-E, Capros, P, Psarras, J
core +2 more sources
On stability in multiobjective programming - a stochastic approach [PDF]
Mathematical Programming, 1992 We assume that a deterministic multiobjective programming problem is approximated by surrogate problems based on estimations for the objective functions and the constraints.
Vogel, Silvia
core +3 more sources
MultiObjective Programming and Goal Programming [PDF]
, 2009 This book gives the reader an insight into the state of the art in the field of multiobjective (linear, nonlinear and combinatorial) programming, goal programming and multiobjective metaheuristics.
Ehrgott, Matthias +3 more
core +4 more sources
Multiobjective programming and planning [PDF]
, 1978 Multiobjective programming and ...
Cohon, Jared L
core +2 more sources
Continuous multiobjective programming [PDF]
, 2016 We present our view of the state of the art in continuous multiobjective programming. After an introduction we formulate the multiobjective program (MOP) and define the most important solution concepts in Sect. 18.2. In Sect. 18.3 we summarize properties
Matthias Ehrgott +5 more
core +2 more sources
On Approximate Efficiency in Multiobjective Programming
Mathematical Methods of Operations Research, 2006 A new definition for approximate efficiency is given for vector, that is, multi-objective optimization. Relations of this new \(\varepsilon\)-efficiency with existing corresponding approximate efficiency concepts are studied. Necessary and sufficient conditions for \(\varepsilon\)-efficiency are presented for convex problems using the well-known ...
César Gutiérrez +2 more
openaire +4 more sources
A method for generating a well-distributed Pareto set in nonlinear multiobjective optimization [PDF]
, 2009 A method is presented for generating a well-distributed Pareto set in nonlinear multiobjective optimization. The approach shares conceptual similarity with the Physical Programming-based method, the Normal-Boundary Intersection and the Normal ...
Utyuzhnikov, S.V.; id_orcid +7 more
core +1 more source
Relaxations and duality for multiobjective integer programming
Mathematical Programming, 2023 Multiobjective integer programs (MOIPs) simultaneously optimize multiple objective functions over a set of linear constraints and integer variables. In this paper, we present continuous, convex hull and Lagrangian relaxations for MOIPs and examine the relationship among them.
Alex Dunbar +2 more
openaire +3 more sources
Optimality conditions and duality in multiobjective programming with invexity [PDF]
Yugoslav Journal of Operations Research, 2008 (', ρ)-invexity has recently been introduced with the intent of generalizing invex functions in mathematical programming. Using such conditions we obtain new sufficiency results for optimality in multiobjective programming and extend some classical ...
Ferrara Massimiliano +1 more
doaj +1 more source