The Global Optimum Solution to a Nonlinear Programming Problems (NLP)

Multiple Choice

The global optimum solution to a nonlinear programming problems (NLP) , in which the objective function must be maximized, is:

A) always larger than the local optimum solution
B) always smaller than the local optimum solution
C) is smaller or equal to the local optimum solution
D) is larger or equal to the local optimum solution