On Optimization over the Efficient Set in Linear Multicriteria Programming

The efficient set of a linear multicriteria programming problem can be represented\nby a reverse convex constraint of the form g(z) ≤ 0, where g is a concave\nfunction. Consequently, the problem of optimizing some real function over the efficient\nset belongs to an important problem class of global...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of optimization theory and applications Vol. 134; no. 3; pp. 433 - 443
Main Authors:	山本芳嗣, Horst R., Thoai N.V., Yamamoto Yoshitsugu, Zenke D.
Format:	Journal Article
Language:	English
Published:	New York, NY Springer Verlag 01.09.2007 Springer Springer Nature B.V
Subjects:	Algorithms Applied sciences Construction Euclidean space Exact sciences and technology Handling Linear programming Materials handling Mathematical programming Multiple criteria decision making Operational research and scientific management Operational research. Management science Optimization Optimization techniques Programming Studies Optimization over the efficient set Multicriteria analysis Linear form Global optimum Linear programming Multicriteria optimization Minimum maximal flow problem Convex programming Optimization Concave function Global optimization Real function Minimax problem Reverse convex constraint Optimal flow
ISSN:	0022-3239, 1573-2878
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!