definition · term 11 of 25
nonlinear programming (NLP).
Optimization where the objective or some constraints are nonlinear functions of the decision variables.
worked examplelosses grow with the squareLine losses in a grid grow with the square of the flow. Doubling the flow on one line quadruples its losses, so the best dispatch spreads flow across lines.
in plain language
Demand falls along a curve as price rises. Losses grow with the square of a flow, and efficiency changes with load. These relations are nonlinear. Convex nonlinear problems can be solved to proven optimality. Non-convex ones may have several local optima, and solvers then report bounds instead of a certified optimum.
nonlinear programming, on your own decision.
Bring one recurring decision. Your planners see the terms of this glossary applied to their own rules and data.
- Glossary
- all 25 terms, a to z
- Problem types
- the decisions kint solves
- Comparisons
- kint next to other approaches
- Contact
- hello@kint.pro