Parametric programming ====================== Parametric programming is a type of mathematical optimization, where the optimization problem is solved as a function of one or multiple parameters. Developed in parallel to sensitivity analysis, its earliest mention can be found in a thesis from 1952. Since then, there have been considerable developments for the cases of multiple parameters, presence of integer variables as well as nonlinearities. Parametric programming is a type of mathematical optimization, where the optimization problem is solved as a function of one or multiple parameters. Developed in parallel to sensitivity analysis, its earliest mention can be found in a thesis from 1952. Since then, there have been considerable developments for the cases of multiple parameters, presence of integer variables as well as nonlinearities. J^*(\theta) = & \min_{x\in\mathbb R^n} f(x,\theta) \\ & \text{subject to } g(x,\theta)\leq 0.\\ & \theta \in \Theta \subset \mathbb R^m \end{align} where x is the optimization variable, \theta are the parameters, f(x,\theta) is the objective function and g(x,\theta) denote the constraints. J^* denotes a function whose output is the optimal value of the objective function f . The set \Theta is generally referred to as parameter space. The optimal value (i.e. result of solving the optimization problem) is obtained by evaluating the function with an argument \theta . ==References== REFERENCES ---------- BIBLIOGRAPHY (BibTeX) -------------------- @article{ref0, title = {Parametric programming}, url = {https://encyclopegia.org/a/parametric-programming} } BIBLIOGRAPHY (RIS) ------------------- TY - JOUR TI - Parametric programming UR - https://encyclopegia.org/a/parametric-programming ER - CITE THIS ARTICLE ---------------- Cite this article: Parametric programming Derived from: https://en.wikipedia.org/w/index.php?oldid=1355581538 Licence: CC BY-SA 4.0 Snapshot: enwiki-001355581538 Permalink: /a/parametric-programming