caa a22 4500 465774482 CHVBK 20180323111938.0 cr unu---uuuuu 170327e19901201xx s 000 0 eng 10.1007/BF02283685 doi (NATIONALLICENCE)springer-10.1007/BF02283685 A level set algorithm for a class of reverse convex programs [Elektronische Daten] [Sihem Ben Saad, Stephen Jacobsen] A new algorithm is presented for minimizing a linear function subject to a set of linear inequalities and one additional reverse convex constraint. The algorithm utilizes a conical partition of the convex polytope in conjuction with its facets in order to remain on the level surface of the reverse convex constraint. The algorithm does not need to solve linear programs on a set of cones which converges to a line segment. J.C. Baltzer A.G. Scientific Publishing Company, 1990 Ben Saad Sihem AT&T Bell Laboratories, 07733, Holmdel, NJ, USA aut Jacobsen Stephen Department of Electrical Engineering, University of California, 90024, Los Angeles, CA, USA aut Annals of Operations Research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers 25/1(1990-12-01), 19-42 0254-5330 25:1<19 1990 25 10479 https://doi.org/10.1007/BF02283685 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02283685 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Ben Saad Sihem AT&T Bell Laboratories, 07733, Holmdel, NJ, USA aut NATIONALLICENCE 700 1- Jacobsen Stephen Department of Electrical Engineering, University of California, 90024, Los Angeles, CA, USA aut NATIONALLICENCE 773 0- Annals of Operations Research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers 25/1(1990-12-01), 19-42 0254-5330 25:1<19 1990 25 10479 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer