<aside> 💡 These are all useless to memorize.
</aside>
Linear Programming (LP) | $A$ has linear constraints, and $f$ is linear |
---|---|
Integer Programming (IP) | Same as LP but we optimize over integer points in $A$ |
Nonlinear Programming (NLP) | $A$ has nonlinear constraints, and $f$ is nonlinear. |
An algorithm is efficient if its worst case is polynomial.