Optimization problem

Problem of finding the best feasible solution

For broader coverage of this topic, see Mathematical optimization.

In mathematics, engineering, computer science and economics, 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 which an object such as an integer, permutation or graph must be found from a countable set.
* A problem with continuous variables is known as a continuous optimization, in which an optimal value from a continuous function must be found. They can include constrained problems and multimodal problems.

## Search space

[edit]

In the context of an optimization problem, the search space refers to the set of all possible points or solutions that satisfy the problem's constraints, targets, or goals.[1] These points represent the feasible solutions that can be evaluated to find the optimal solution according to the objective function. The search space is often defined by the domain of the function being optimized, encompassing all valid inputs that meet the problem's requirements.[2]

The search space can vary significantly in size and complexity depending on the problem. For example, in a continuous optimization problem, the search space might be a multidimensional real-valued domain defined by bounds or constraints. In a discrete optimization problem, such as combinatorial optimization, the search space could consist of a finite set of permutations, combinations, or configurations.

In some contexts, the term search space may also refer to the optimization of the domain itself, such as determining the most appropriate set of variables or parameters to define the problem. Understanding and effectively navigating the search space is crucial for designing efficient algorithms, as it directly influences the computational complexity and the likelihood of finding an optimal solution.

## Continuous optimization problem

[edit]

The standard form of a continuous optimization problem is[3] minimize x f ( x ) s u b j e c t t o g i ( x ) ≤ 0 , i = 1 , … , m h j ( x ) = 0 , j = 1 , … , p {\displaystyle {\begin{aligned}&{\underset {x}{\operatorname {minimize} }}&&f(x)\\\&\operatorname {subject\;to} &&g_{i}(x)\leq 0,\quad i=1,\dots ,m\\\&&&h_{j}(x)=0,\quad j=1,\dots ,p\end{aligned}}} where

* f : ℝn → ℝ is the objective function to be minimized over the n-variable vector x,
* gi(x) ≤ 0 are called inequality constraints
* hj(x) = 0 are called equality constraints, and
* m ≥ 0 and p ≥ 0.

If m = p = 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]

Main article: Combinatorial optimization

Formally, a combinatorial optimization problem A is a quadruple[citation needed] (I, f, m, g), where

* I is a set of instances;
* given an instance x ∈ I, f(x) is the set of feasible solutions;
* given an instance x and a feasible solution y of x, m(x, y) denotes the measure of y, which is usually a positive real.
* g is the goal function, and is either min or max.

The goal is then to find for some instance x an optimal solution, that is, a feasible solution y with  m ( x , y ) = g { m ( x , y ′ ) : y ′ ∈ f ( x ) } . {\displaystyle m(x,y)=g\left\\{m(x,y'):y'\in f(x)\right\\}.}

For each combinatorial optimization problem, there is a corresponding decision problem that asks whether there is a feasible solution for some particular measure m0. For example, if there is a graph G which contains vertices u and v, an optimization problem might be "find a path from u to v 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 u to v 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.[4]

## See also

[edit]

* Counting problem (complexity) – Type of computational problem
* Design Optimization
* Ekeland's variational principle – theorem that asserts that there exist nearly optimal solutions to some optimization problemsPages displaying wikidata descriptions as a fallback
* Function problem – Type of computational problem
* Glove problem
* Operations research – Discipline concerning the application of advanced analytical methods
* Satisficing – Cognitive heuristic of searching for an acceptable decision − the optimum need not be found, just a "good enough" solution.
* Search problem – type of computational problem represented by a binary relationPages displaying wikidata descriptions as a fallback
* Semi-infinite programming – optimization problem with a finite number of variables and an infinite number of constraints, or an infinite number of variables and a finite number of constraintsPages displaying wikidata descriptions as a fallback

## References

[edit]

1. ^ "Search Space". courses.cs.washington.edu. Retrieved 2025-05-10.
2. ^ "Search Space - LessWrong". www.lesswrong.com. 2020-09-22. Retrieved 2025-05-10.
3. ^ Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (pdf). Cambridge University Press. p. 129\. ISBN 978-0-521-83378-3.
4. ^ Ausiello, Giorgio; et al. (2003), Complexity and Approximation (Corrected ed.), Springer, ISBN 978-3-540-65431-5

## External links

[edit]

* "How Traffic Shaping Optimizes Network Bandwidth". IPC. 12 July 2016. Retrieved 13 February 2017.

* v
* t
* e

Convex analysis and variational analysis

Basic concepts|

* Convex combination
* Convex function
* Convex set

Topics (list)|

* Choquet theory
* Convex geometry
* Convex metric space
* Convex optimization
* Duality
* Lagrange multiplier
* Legendre transformation
* Locally convex topological vector space
* Simplex

Maps|

* Convex conjugate
* Concave
* (Closed
* K-
* Logarithmically
* Proper
* Pseudo-
* Quasi-) Convex function
* Invex function
* Legendre transformation
* Semi-continuity
* Subderivative

Main results (list)|

* Carathéodory's theorem
* Ekeland's variational principle
* Fenchel–Moreau theorem
* Fenchel-Young inequality
* Jensen's inequality
* Hermite–Hadamard inequality
* Krein–Milman theorem
* Mazur's lemma
* Shapley–Folkman lemma
* Robinson–Ursescu
* Simons
* Ursescu

Sets|

* Convex hull
* (Orthogonally, Pseudo-) Convex set
* Effective domain
* Epigraph
* Hypograph
* John ellipsoid
* Lens
* Radial set/Algebraic interior
* Zonotope

Series|

* Convex series related ((cs, lcs)-closed, (cs, bcs)-complete, (lower) ideally convex, (Hx), and (Hwx))

Duality|

* Dual system
* Duality gap
* Strong duality
* Weak duality

Applications and related|

* Convexity in economics

Authority control databases: National |

* Germany

|

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template