An inner approximation method incorporating with a penalty function 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. When X is not necessarily a polytope, an inner approximation method has been proposed (J. Optim. Theory A...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computational and applied mathematics Jg. 146; H. 1; S. 57 - 75
Hauptverfasser: Yamada, Syuuji, Tanino, Tetsuzo, Inuiguchi, Masahiro
Format: Journal Article Tagungsbericht
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 01.09.2002
Elsevier
Schlagworte:
Applied sciences
Dual problem
Exact sciences and technology
Global optimization
Inner approximation method
Mathematical programming
Operational research and scientific management
Operational research. Management science
Penalty function method
Reverse convex programming problem
Inner approximation method
Dual problem
Penalty function method
Global optimization
Reverse convex programming problem
Polytope
Penalty function
Optimal solution
Global optimum
Duality
Convex function
Convex programming
Convergence
ISSN:0377-0427, 1879-1778
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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. When X is not necessarily a polytope, an inner approximation method has been proposed (J. Optim. Theory Appl. 107(2) (2000) 357). The algorithm utilizes inner approximation of X by a sequence of polytopes to generate relaxed problems. Then, every accumulation point of the sequence of optimal solutions of relaxed problems is an optimal solution of the original problem. In this paper, we improve the proposed algorithm. By underestimating the optimal value of the relaxed problem, the improved algorithms have the global convergence.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0377-0427
1879-1778
DOI:10.1016/S0377-0427(02)00418-1