Skip to content

Parametric Constrained Optimization Problem

Definition

A parametric constrained optimization problem is an optimization problem whose objective, constraints, or feasible set depend on a parameter. A typical equality-constrained maximization problem has the form

V(s)=max⁡xf(x,s)subject tog(x,s)=0.\begin{aligned} &V(s)=\max_{\boldsymbol{x}} f(\boldsymbol{x},s)\\ &\text{subject to}\quad g(\boldsymbol{x},s)=0. \end{aligned}

The parameter ss is not optimized over; it changes the problem being solved.


Interpretation

A parametric problem asks how the best choice and best value move when outside conditions change.

Parallel constraint lines x1 + x2 = s for s = 2, 3 and 4 against circular level sets of f, with the optimum on each line joined by a dashed path of optima x star of s.

In the figure, the parameter ss sets the constraint level h(x)=sh(\boldsymbol{x})=s, and V(s)=max⁡{f(x) ⁣:h(x)=s}V(s)=\max\{f(\boldsymbol{x})\colon h(\boldsymbol{x})=s\}. The blue lines show different feasible sets, the grey circles are level sets of ff, and the dashed path follows the corresponding optima x∗(s)\boldsymbol{x}^\ast(s).

At a fixed parameter value, the equality-constraint Lagrange method handles the equality example. If inequalities are present, the inequality-constrained maximization method also imposes multiplier signs and complementary slackness. Only after solving each fixed-parameter problem does one study how its optimizer and value change.


Key Results


Examples

  • A firm may maximize profit over inputs while the wage rate is a parameter.
  • A consumer may maximize utility over bundles while income is a parameter in the budget constraint.

Prerequisites

Sources

Aliases: parameterized constrained optimization Keywords: parametric optimization problem, comparative statics problem

Last updated: 17 October 2026 21:53