Global optimization of 0-1 hyperbolic programs

Mohit Tawarmalani, Shabbir Ahmed, Nikolaos V. Sahinidis

Research output: Contribution to journalArticlepeer-review


We develop eight different mixed-integer convex programming reformulations of 0-1 hyperbolic programs. We obtain analytical results on the relative tightness of these formulations and propose a branch and bound algorithm for 0-1 hyperbolic programs. The main feature of the algorithm is that it reformulates the problem at every node of the search tree. We demonstrate that this algorithm has a superior convergence behavior than directly solving the relaxation derived at the root node. The algorithm is used to solve a discrete p-choice facility location problem for locating ten restaurants in the city of Edmonton.

Original languageEnglish (US)
Pages (from-to)385-416
Number of pages32
JournalJournal of Global Optimization
Issue number4
StatePublished - Dec 2002


  • Convex extensions
  • Facility location
  • Fractional programming

ASJC Scopus subject areas

  • Computer Science Applications
  • Management Science and Operations Research
  • Control and Optimization
  • Applied Mathematics


Dive into the research topics of 'Global optimization of 0-1 hyperbolic programs'. Together they form a unique fingerprint.

Cite this