caa a22 4500 465774393 CHVBK 20180323111937.0 cr unu---uuuuu 170327e19901201xx s 000 0 eng 10.1007/BF02283684 doi (NATIONALLICENCE)springer-10.1007/BF02283684 On solving general reverse convex programming problems by a sequence of linear programs and line searches [Elektronische Daten] [Reiner Horst, Thai Phong, Nguyen Thoai] Many multiextremal global optimization problems can be formulated as problems of minimizing a linear function over the intersection of a convex set with the complement of a convex set (so-called canonical d.c. programs or general reverse convex programming problems). In this paper it is shown that these general reverse convex programming problems can be solved by a sequence of linear programs and univariate convex minimization problems (line searches). J.C. Baltzer A.G. Scientific Publishing Company, 1990 Horst Reiner Universität Trier, Trier, F.R. Germany aut Phong Thai Institute of Mathematics, Hanoi, Vietnam aut Thoai Nguyen aut Annals of Operations Research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers 25/1(1990-12-01), 1-17 0254-5330 25:1<1 1990 25 10479 https://doi.org/10.1007/BF02283684 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02283684 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Horst Reiner Universität Trier, Trier, F.R. Germany aut NATIONALLICENCE 700 1- Phong Thai Institute of Mathematics, Hanoi, Vietnam aut NATIONALLICENCE 700 1- Thoai Nguyen aut NATIONALLICENCE 773 0- Annals of Operations Research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers 25/1(1990-12-01), 1-17 0254-5330 25:1<1 1990 25 10479 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer