Optimization Task
(Redirected from optimization task)
Jump to navigation
Jump to search
An Optimization Task is a search task for an optimal solution from within a search space based on a utility function.
- AKA: Cost Function Optimization, Numerical Optimization.
- Context:
- Task Input: Search Space, and a Cost Function.
- Task Output: Optimal Solution.
- ...
- It can range from being a Minimization Task to being a Maximization Task, depending on its optimization goal.
- It can range from being a Combinatorial Optimization Task to being a Continuous Optimization Task, depending on its variable type.
- It can range from being an Exact Optimization Task to being an Approximate Optimization Task, depending on its solution precision.
- It can range from being an Unconstrained Optimization Task to being a Constrained Optimization Task, depending on its solution constraints.
- ...
- It can be solved by an Optimization System through optimization algorithms.
- ...
- Examples:
- Combinatorial Optimization Tasks, such as:
- Continuous Optimization Tasks, such as:
- Parameter Optimizations, such as:
- Industrial Process Optimizations, such as:
- ...
- Counter-Examples:
- Random Search Task, which does not target optimal solutions.
- Constraint Satisfaction Task, which finds feasible solutions rather than optimal solutions.
- Classification Task, which categorizes rather than optimizes.
- Pattern Matching Task, which identifies rather than optimizes.
- See: Constraint Satisfaction, Function Selection Task, Optimization Task Decomposition, Search Algorithm, Mathematical Programming.
References
2015
- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/optimization_problem Retrieved:2015-6-13.
- 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 combinatorial optimization problem. In a combinatorial optimization problem, we are looking for an object such as an integer, permutation or graph from a finite (or possibly countable infinite) set.