Results 191 to 200 of about 32,569 (254)
Some of the next articles are maybe not open access.
Approximation Methods in Multiobjective Programming
Journal of Optimization Theory and Applications, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ruzika, S., Wiecek, M. M.
openaire +1 more source
Nonlinear Multiobjective Programming
2003This chapter provides an annotated bibliography of nonlinear multiobjective programming. The list of references comprises more than 500 entries. First we explain some solution concepts which are fundamental and important in multiobjective optimization. Some basic properties of the solution sets are also discussed.
Tetsuzo Tanino, Hun Kuk
openaire +1 more source
Nonsmooth multiobjective programming
Numerical Functional Analysis and Optimization, 1989Necessary Lagrangian conditions are obtained for a weak minimum of a nonsmooth constrained multiobjective programming problem, assuming Lipschitzfunctions and general cone constraints. This generalizes a result of F. Clarke. A vector dual problem is deduced.
openaire +1 more source
Multiobjective dynamic programming
Mathematische Operationsforschung und Statistik. Series Optimization, 1978In this paper the method of dynamic programming is carried to recurrence computations of sets of optimal values for discrete dynamic systems and vector-valued objective functions.
openaire +2 more sources
Multiobjective Linear Programming
2013The problem to optimize multiple conflicting linear objective functions simultaneously under the given linear constraints is called the multiobjective linear programming problem. This chapter begins with a discussion of fundamental notions and methods of multiobjective linear programming.
Masatoshi Sakawa +2 more
openaire +1 more source
Continuous Multiobjective Programming
2016We 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 of efficient and nondominated sets. Optimality conditions are reviewed in Sect. 18.4. The main part
Wiecek, Margaret M. +2 more
openaire +1 more source
2014
Optimization problems with multiple criteria measuring solution quality can be modeled as multiobjective programming problems. Because the objective functions are usually in conflict, there is not a single feasible solution that can optimize all objective functions simultaneously. An optimal solution is one that is most preferred by the decision maker (
openaire +1 more source
Optimization problems with multiple criteria measuring solution quality can be modeled as multiobjective programming problems. Because the objective functions are usually in conflict, there is not a single feasible solution that can optimize all objective functions simultaneously. An optimal solution is one that is most preferred by the decision maker (
openaire +1 more source
Generalized Concavity in Multiobjective Programming
1998In this survey we present the fundamental ideas and results related to the role played by generalized concavity in stating sufficient optimality conditions, in studying local and global efficiency, in finding relationships between local efficiency and efficiency along feasible directions, and in establishing the connectedness of the efficient point ...
CAMBINI, ALBERTO, MARTEIN LAURA
openaire +2 more sources
Multiobjective programming under d-invexity
European Journal of Operational Research, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Symmetric dual multiobjective programming
European Journal of Operational Research, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Das, L. N., Nanda, S.
openaire +1 more source