liveBook · Manning

Univariate

As explained in Optimization Algorithms: AI techniques for design, planning, and control problems

An optimization problem with exactly one decision variable.

A univariate optimization problem has exactly one decision variable. It contrasts with a multivariate problem, which optimizes two or more variables. section 2.1.1

Vehicle fuel economy

Suppose the only decision is vehicle speed, and the goal is to maximize fuel economy. The problem is univariate. Adding acceleration creates a bivariate problem; adding tire pressure creates a multivariate problem. section 2.1.1

Classify the problem along separate dimensions:

  • Count decision variables: one variable is univariate; multiple variables are multivariate. section 2.1.1
  • Classify variable type separately: a univariate problem may involve a continuous or discrete variable. section 2.1.1
  • Distinguish variable count from other properties, including objective count, constraints, landscape, linearity, and search strategy. section 2.5

How Optimization Algorithms: AI techniques for design, planning, and control problems covers it

How deep it goes
Defines the one-variable distinction and contrasts it with multivariate cases, without developing a solution algorithm.
Examples
Uses vehicle speed, acceleration, and tire pressure to distinguish univariate, bivariate, and multivariate formulations.
What you can do after
Evaluate/understand whether an optimization formulation has one decision variable or several.
How it connects
Contrasts univariate optimization with multivariate, continuous, discrete, mixed-integer, constrained, and nonlinear optimization.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Optimization Algorithms: AI techniques for design, planning, and control problems. The section links point to the parts of the book it draws on.