Optimization over the efficient set: Four special cases
نویسندگان
چکیده
منابع مشابه
Optimization over k-set Polytopes and Efficient k-set Enumeration
We present two versions of an algorithm based on the reverse search technique for enumerating all k-sets of a point set in R d. The key elements include the notion of a k-set polytope and the optimization of a linear function over a k-set polytope.
متن کاملOn Optimization over the Efficient Set in Linear Multicriteria Programming
The efficient set of a linear multicriteria programming problem can be represented by a ’reverse convex constraint’ of the form g(z) ≤ 0, where g is a concave function. Consequently, the problem of optimizing some real function over the efficient set belongs to an important problem class of global optimization called reverse convex programming. Since the concave function used in the literature ...
متن کاملMinimum Maximal Flow Problem: An Optimization over the Efficient Set
The network flow theory and algorithms have been developed on the assumption that each arc flow is controllable and we freely raise and reduce it. We however consider in this paper the situation where we are not able or allowed to reduce the given arc flow. Then we may end up with a maximal flow depending on the initial flow as well as the way of augmentation. Therefore the minimum of the flow ...
متن کاملPart I: Methods Optimization under Composite Monotonic Constraints and Constrained Optimization over the Efficient Set
We present a unified approach to a class of nonconvex global optimization problems with composite monotonic constraints. (By composite monotonic function is meant a function which is the composition of a monotonic function on R n with a mapping from R n → R m with m ≤ n.) This class includes problems with constraints involving products of linear functions, sums of ratio functions, etc., and als...
متن کاملEmpirical Estimates in Stochastic Optimization: Special Cases
Classical” optimization problems depending on a probability measure (and corresponding to many applications) belong mostly to a class of nonlinear deterministic optimization problems that are (from the numerical point of view) relatively complicated. On the other hand, these problems fulfill very often “suitable” mathematical properties guaranteing the stability (w.r.t probability measure) and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 1994
ISSN: 0022-3239,1573-2878
DOI: 10.1007/bf02196590