NMaximize

NMaximize[f,x]

maximizes f numerically with respect to x.

NMaximize[f,{x,y,}]

maximizes f numerically with respect to x, y, .

NMaximize[{f,cons},{x,y,}]

maximizes f numerically subject to the constraints cons.

NMaximize[,xreg]

constrains x to be in the region reg.

Details and Options  • NMaximize returns a list of the form {fmax,{x->xmax,y->ymax,}}.
• cons can contain equations, inequalities or logical combinations of these.
• The constraints cons can be any logical combination of:
•  lhs==rhs equations lhs>rhs or lhs>=rhs inequalities {x,y,…}∈reg region specification
• NMaximize[{f,cons},xreg] is effectively equivalent to NMaximize[{f,consxreg},x].
• For xreg, the different coordinates can be referred to using Indexed[x,i].
• NMaximize always attempts to find a global maximum of f subject to the constraints given.
• By default, all variables are assumed to be real.
• xIntegers can be used to specify that a variable can take on only integer values.
• If f and cons are linear, NMaximize can always find global maxima, over both real and integer values.
• Otherwise, NMaximize may sometimes find only a local maximum.
• If NMaximize determines that the constraints cannot be satisfied, it returns {-Infinity,{x->Indeterminate,}}.
• The following options can be given:
•  AccuracyGoal Automatic number of digits of final accuracy sought EvaluationMonitor None expression to evaluate whenever f is evaluated MaxIterations Automatic maximum number of iterations to use Method Automatic method to use PrecisionGoal Automatic number of digits of final precision sought StepMonitor None expression to evaluate whenever a step is taken WorkingPrecision MachinePrecision the precision used in internal computations
• The settings for AccuracyGoal and PrecisionGoal specify the number of digits to seek in both the value of the position of the maximum, and the value of the function at the maximum.
• NMaximize continues until either of the goals specified by AccuracyGoal or PrecisionGoal is achieved.
• Possible settings for the Method option include "NelderMead", "DifferentialEvolution", "SimulatedAnnealing", and "RandomSearch".

Examples

open all close all

Basic Examples(3)

Find the global maximum of an unconstrained problem:

 In:= Out= Extract the maximizing argument:

 In:= Out= Find the global maximum of problems with constraints:

 In:= Out= In:= Out= Maximize a function over a geometric region:

 In:= Out= Plot it:

 In:= Out= Possible Issues(3)

Introduced in 2003
(5.0)
|
Updated in 2014
(10.0)