Lineairprogrammimine
Lineairprogrammimine is a mathematical optimization technique used to obtain the best outcome under linear relationships. It models a linear objective function to be optimized (maximized or minimized) subject to linear equality and inequality constraints, with decision variables constrained to take real values within specified bounds.
The conventional formulation expresses either as maximize c^T x subject to Ax ≤ b, x ≥ 0, or
Solutions are typically obtained by the simplex method, which traverses adjacent vertices, or by interior-point methods,
Lineairprogrammimine has broad applications in operations research, economics and engineering, including resource allocation, production planning, transportation
Historical note: the method was formalized by George Dantzig in 1947, contributing to the development of operations