Results 201 to 210 of about 853,756 (250)
Some of the next articles are maybe not open access.

Multiobjective Programming

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

(p,r)-Invexity in multiobjective programming

European Journal of Operational Research, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Multiobjective Programming and Planning

open access: yes, 1978
Multiobjective programming and ...
Cohon, Jared L
openaire   +2 more sources

Multiobjective programming under d-invexity

European Journal of Operational Research, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Multiobjective Linear Programming

2013
The 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

A Duality Theorem in Multiobjective Nonlinear Programming

Mathematics of Operations Research, 1982
We give a duality theorem in multiobjective nonlinear programming problems by means of conjugate set-valued functions which were introduced in (Kawasaki, H. 1981. Conjugate relations and weak subdifferentials of relations. Math. Oper. Res. 6 593–607.). The duality theorem is reflexive in the sense analogous to (Ekeland, I., R. Temam. 1976.
openaire   +3 more sources

Nonlinear Multiobjective Programming

2003
This 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

Multiobjective and Bilevel Programming

1997
This last chapter is devoted to two problems of practical interest which have been the subject of extensive research in recent years. These problems are closely related to each other and can be reformulated as convex programs with an additional reverse convex constraint.
Hiroshi Konno   +2 more
openaire   +1 more source

Nonsmooth multiobjective programming

Numerical Functional Analysis and Optimization, 1989
Necessary 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, 1978
In 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

Home - About - Disclaimer - Privacy