Optimization problem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In mathematics and computer science, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization problems can be divided into two categories depending on whether the variables are continuous or discrete. An optimization problem with discrete variables is known as a discrete optimization. In a discrete optimization problem, we are looking for an object such as an integer, permutation or graph from a countable set. Problems with continuous variables include constrained problems and multimodal problems.

Continuous optimization problem[edit]

The standard form of a continuous optimization problem is[1]


  • is the objective function to be minimized over the n-variable vector ,
  • are called inequality constraints
  • are called equality constraints, and
  • .

If and equal 0, the problem is an unconstrained optimization problem. By convention, the standard form defines a minimization problem. A maximization problem can be treated by negating the objective function.

Combinatorial optimization problem[edit]

Formally, a combinatorial optimization problem is a quadruple[citation needed] , where

  • is a set of instances;
  • given an instance , is the set of feasible solutions;
  • given an instance and a feasible solution of , denotes the measure of , which is usually a positive real.
  • is the goal function, and is either or .

The goal is then to find for some instance an optimal solution, that is, a feasible solution with

For each combinatorial optimization problem, there is a corresponding decision problem that asks whether there is a feasible solution for some particular measure . For example, if there is a graph which contains vertices and , an optimization problem might be "find a path from to that uses the fewest edges". This problem might have an answer of, say, 4. A corresponding decision problem would be "is there a path from to that uses 10 or fewer edges?" This problem can be answered with a simple 'yes' or 'no'.

In the field of approximation algorithms, algorithms are designed to find near-optimal solutions to hard problems. The usual decision version is then an inadequate definition of the problem since it only specifies acceptable solutions. Even though we could introduce suitable decision problems, the problem is more naturally characterized as an optimization problem.[2]

See also[edit]


  1. ^ Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (pdf). Cambridge University Press. p. 129. ISBN 978-0-521-83378-3.
  2. ^ Ausiello, Giorgio; et al. (2003), Complexity and Approximation (Corrected ed.), Springer, ISBN 978-3-540-65431-5

External links[edit]