Global optimization for special reverse convex programming

A global optimization algorithm is proposed in order to locate the global minimum of the special reverse convex programming which is both nonconvex and nonlinear. Three new strategies are adopted in this paper. Some of them can be used to solve general reverse convex programming. Global solution loc...

Full description

Bibliographic Details

Published in:	Computers & mathematics with applications (1987) Vol. 55; no. 6; pp. 1154 - 1163
Main Authors:	Wang, Yanjun, Lan, Ying
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.03.2008
Subjects:	Algorithms Branch and bound Convergence Global optimization Linear relaxation programming Mathematical models Optimization Programming Reverse convex programming Strategy Upper bounds Reverse convex programming Global optimization Linear relaxation programming Branch and bound
ISSN:	0898-1221, 1873-7668
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!