Inner Approximation Method for a Reverse Convex Programming Problem

In this paper, we consider a reverse convex programming problem constrained by a convex set and a reverse convex set, which is defined by the complement of the interior of a compact convex set X. We propose an inner approximation method to solve the problem in the case where X is not necessarily a p...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of optimization theory and applications Vol. 107; no. 2; pp. 355 - 389
Main Authors:	Yamada, S., Tanino, T., Inuiguchi, M.
Format:	Journal Article
Language:	English
Published:	New York, NY Springer 01.11.2000 Springer Nature B.V
Subjects:	Algorithms Applied sciences Approximation Engineering schools Exact sciences and technology Information systems Mathematical functions Mathematical programming Operational research and scientific management Operational research. Management science Optimization Polytope Penalty function Global optimum Duality Convex programming
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!