Question: If a nonlinear programming problem has no constraints, the objective function being concave guarantees that a local maximum is a global maximum. Show that
If a nonlinear programming problem has no constraints, the objective function being concave guarantees that a local maximum is a global maximum. Show that the objective function Z is concave. Z=126x1-9x1 ^2 +2x2 - 4x2 ^2.
Step by Step Solution
3.45 Rating (145 Votes )
There are 3 Steps involved in it
To show that the objective function Z is concave we need to show that the second partial derivatives ... View full answer
Get step-by-step solutions from verified subject matter experts
