by N/A – mathematical method, not a product • Founded 1947
Linear programming (LP) is a mathematical optimization technique for maximizing or minimizing a linear objective function subject to linear equality and inequality constraints. It provides a systematic way to allocate limited resources—such as time, money, or materials—across competing activities. LP is foundational in operations research, powering decision-making in logistics, finance, manufacturing, and many AI/ML pipelines for constrained optimization.
Extends linear programming by allowing some variables to be integer-valued, enabling modeling of discrete decisions at the cost of NP-hard complexity.
Generalizes LP by allowing a quadratic objective with linear constraints, useful when costs or risks are better modeled quadratically.
Handles nonlinear objectives and constraints, enabling more realistic but potentially non-convex models.
Focuses on combinatorial problems with logical and discrete constraints, using search and propagation rather than purely algebraic methods.
Approximate optimization methods that do not rely on linearity or convexity, often used when exact methods are infeasible.