Return to Index
Operations Research Models and Methods
Problems Section
Nonlinear Programming Models
 - Model Convexity

Consider the functions defined below.

Consider each of the mathematical programming models below. Say we solve the model with a reliable nonlinear programming solver. We are sure that the solver stops with local optimum. In each case, say whether or not you have found the global optimum and justify your conclusion.

Model 1

Model 2

Model 3

Return to Top

tree roots

Operations Research Models and Methods
by Paul A. Jensen
Copyright 2001 - All rights reserved