An 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 po...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028) Ročník 3; s. 521 - 526 vol.3
Hlavní autori:	Yamada, S., Tanino, T., Inuiguchi, M., Tatsumi, K.
Médium:	Konferenčný príspevok..
Jazyk:	English Japanese
Vydavateľské údaje:	IEEE 20.01.2003
Predmet:	Approximation algorithms Approximation methods Electronic mail Information systems Optimization methods
ISBN:	9780780357310, 0780357310
ISSN:	1062-922X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!