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.
KeywordsNonlinear Program Machine Cost Unit Production Cost Poly Module Polynomial Program
Unable to display preview. Download preview PDF.