NMinimize({maximize_function, constraints}, variables_list)
the
NMinimize
function provides an implementation of George Dantzig's simplex algorithm for solving linear optimization problems with linear equality and inequality constraints and implicit non-negative variables.
See:
>> NMinimize({-2*x+y-5, x+2*y<=6 && 3*x + 2*y <= 12}, {x, y})
{-13.0,{x->4.0,y->0.0}
solves the linear problem:
Minimize -2x + y - 5
with the constraints:
x + 2y <= 6
3x + 2y <= 12
x >= 0
y >= 0
- ✅ - full supported