On Multiple-Ratio Hyperbolic 0-1 Programming Problems

Multiple-ratio hyperbolic (fractional) 0–1 programming problems are considered. We investigate complexity issues of these problems including local search, approximability and global verification. Some aspects of linear mixed 0–1 reformulations are also discussed. In addition, we present a GRASP-based (Greedy Randomized Adaptive Search) heuristic for solving cardinality constrained problems.

[1]  Roland W. Freund,et al.  Solving the Sum-of-Ratios Problem by an Interior-Point Method , 2001, J. Glob. Optim..

[2]  Panos M. Pardalos,et al.  Complexity of uniqueness and local search in quadratic 0-1 programming , 1992, Oper. Res. Lett..

[3]  Leonidas D. Iasemidis,et al.  Quadratic Binary Programming and Dynamical System Approach to Determine the Predictability of Epileptic Seizures , 2001, J. Comb. Optim..

[4]  Pierre Hansen,et al.  Hyperbolic 0–1 programming and query optimization in information retrieval , 1991, Math. Program..

[5]  Hiroshi Konno,et al.  A Branch and Bound Algorithm for Solving Low Rank Linear Multiplicative and Fractional Programming Problems , 2000, J. Glob. Optim..

[6]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Kenneth Steiglitz,et al.  On the Complexity of Local Search for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[9]  Endre Boros,et al.  Pseudo-Boolean optimization , 2002, Discret. Appl. Math..

[10]  Maurice Queyranne,et al.  A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory , 1982, Networks.

[11]  A. L. Saipe.  Solving a (0, 1) hyperbolic program by branch and bound , 1975 .

[12]  Panos M. Pardalos,et al.  On complexity of unconstrained hyperbolic 0-1 programming problems , 2005, Oper. Res. Lett..

[13]  Ignacio E. Grossmann,et al.  A global optimization algorithm for linear fractional and bilinear programs , 1995, J. Glob. Optim..

[14]  Takahito Kuno,et al.  A branch-and-bound algorithm for maximizing the sum of several linear ratios , 2002, J. Glob. Optim..

[15]  Sheldon H. Jacobson,et al.  Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems , 2003, J. Glob. Optim..

[16]  Siegfried Schaible,et al.  Fractional programming: The sum-of-ratios case , 2003, Optim. Methods Softw..

[17]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[18]  Tai-Hsi Wu.  A note on a global approach for general 0-1 fractional programming , 1997 .

[19]  Nikolaos V. Sahinidis,et al.  Global Optimization of 0-1 Hyperbolic Programs , 2002, J. Glob. Optim..

[20]  Sheldon H. Jacobson,et al.  The effectiveness of finite improvement algorithms for finding global optima , 1993, ZOR Methods Model. Oper. Res..

[21]  Abraham Charnes,et al.  Programming with linear fractional functionals , 1962 .

[22]  Han-Lin Li.  A GLOBAL APPROACH FOR GENERAL 0-1 FRACTIONAL-PROGRAMMING , 1994 .

[23]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.