An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem

This article presents for the first time an algorithm specifically designed for globally minimizing a finite, convex function over the weakly efficient set of a multiple objective nonlinear programming problem (V1) that has both nonlinear objective functions and a convex, nonpolyhedral feasible regi...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 52; no. 3; pp. 553 - 574
Main Author:	Benson, Harold P.
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.03.2012 Springer Nature B.V
Subjects:	Algorithms Approximation Computer Science Mathematics Mathematics and Statistics Nonlinear programming Operations management Operations Research/Decision Theory Optimization Pareto optimum Real Functions Studies Global optimization Multiple objective nonlinear programming Branch and bound Weakly efficient set
ISSN:	0925-5001, 1573-2916
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!