Miscellaneous Problems

  • Mohit Tawarmalani
  • Nikolaos V. Sahinidis
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 65)


In this chapter, we provide computational experience with BARON on a variety of factorable nonlinear programs, including separable concave quadratic programs, indefinite quadratic programs, linear multiplicative programs, univariate polynomial programs, and benchmark problems from diverse application areas. All problems were solved to global optimality with an absolute tolerance of 10-6 unless otherwise specified. Our computational experience demonstrates that it is now possible to solve (mixed-integer) nonlinear optimization problems to global optimality in an automated fashion with reasonable computational resources.


Nonlinear Program Machine Cost Unit Production Cost Poly Module Polynomial Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2002

Authors and Affiliations

  • Mohit Tawarmalani
    • 1
  • Nikolaos V. Sahinidis
    • 2
  1. 1.Purdue UniversityWest LafayetteUSA
  2. 2.University of IllinoisUrbanaUSA

Personalised recommendations