Operations Research Exam 3 Questions and
Answers
A nonlinear optimization problem is any optimization problem in which at least one
term in the objective function or a constraint is nonlinear. - ANSWER-True
A function is considered a quadratic function if its nonlinear terms have a power of
2. - ANSWER-True
Nonlinear programming algorithms are more complex than linear programming
algorithms. - ANSWER-True
Many linear programming algorithms such as the simplex method optimize by
examining only the extreme points and selecting the extreme point that gives the
best solution value. - ANSWER-True
Nonlinear optimization problems can have only one local optimal solution. -
ANSWER-False
For a typical nonlinear problem, if you change the right-hand side by even a small
amount, the dual value changes. - ANSWER-False
The interpretation of the dual price for nonlinear models is different than the
interpretation of the dual price for linear models. - ANSWER-False
It is possible that a nonlinear application in which there is a single local optimal
solution also shows that solution as the global optimal solution. - ANSWER-True
Functions that are convex have a single local maximum that is also the global
maximum. - ANSWER-False
Each point on the efficient frontier is the maximum possible risk, measured by
portfolio variance, for the given return. - ANSWER-False
Any feasible solution to a blending problem with pooled components is feasible to
the problem with no pooling. - ANSWER-True
Any feasible solution to a blending problem without pooled components is feasible
to the problem with pooled components. - ANSWER-False
Because most nonlinear optimization codes will terminate with a local optimum, the
solution returned by the codes will be the best solution. - ANSWER-False
It is possible for the optimal solution to a nonlinear optimization problem to lie in
Answers
A nonlinear optimization problem is any optimization problem in which at least one
term in the objective function or a constraint is nonlinear. - ANSWER-True
A function is considered a quadratic function if its nonlinear terms have a power of
2. - ANSWER-True
Nonlinear programming algorithms are more complex than linear programming
algorithms. - ANSWER-True
Many linear programming algorithms such as the simplex method optimize by
examining only the extreme points and selecting the extreme point that gives the
best solution value. - ANSWER-True
Nonlinear optimization problems can have only one local optimal solution. -
ANSWER-False
For a typical nonlinear problem, if you change the right-hand side by even a small
amount, the dual value changes. - ANSWER-False
The interpretation of the dual price for nonlinear models is different than the
interpretation of the dual price for linear models. - ANSWER-False
It is possible that a nonlinear application in which there is a single local optimal
solution also shows that solution as the global optimal solution. - ANSWER-True
Functions that are convex have a single local maximum that is also the global
maximum. - ANSWER-False
Each point on the efficient frontier is the maximum possible risk, measured by
portfolio variance, for the given return. - ANSWER-False
Any feasible solution to a blending problem with pooled components is feasible to
the problem with no pooling. - ANSWER-True
Any feasible solution to a blending problem without pooled components is feasible
to the problem with pooled components. - ANSWER-False
Because most nonlinear optimization codes will terminate with a local optimum, the
solution returned by the codes will be the best solution. - ANSWER-False
It is possible for the optimal solution to a nonlinear optimization problem to lie in
