Computational experience using an edge search algorithm for linear reverse convex programs

✍ Scribed by Stephen E. Jacobsen; Khosrow Moshirvaziri

• Publisher: Springer US
• Year: 1996
• Tongue: English
• Weight: 831 KB
• Volume: 9
• Category: Article
• ISSN: 0925-5001
• DOI: 10.1007/bf00121661

✦ Synopsis

This paper presents computational experience with a rather straight forward implementation of an edge search algorithm for obtaining the globally optimal solution for linear programs with an additional reverse convex constraint. The paper's purpose is to provide a collection of problems, with known optimal solutions, and performance information for an edge search implementation so that researchers may have some benchmarks with which to compare new methods for reverse convex programs or concave minimization problems. There appears to be nothing in the literature that provides computational experience with a basic edge search procedure. The edge search implementation uses a depth first strategy. As such, this paper's implementation of the edge search algorithm is a modification of Hillestad's algorithm [ 111. A variety of test problems is generated by using a modification of the method of Sung and Rosen [20], as well as a new method that is presented in this paper. Test problems presented may be obtained at ftp://newton.ee.ucla.edu/nonconvex/pub/.