Constrained Optimization Task

A Constrained Optimization Task is a optimization task that has constraints as task inputs.

• AKA: Constraint Optimization.
• Context:
  • It can be solved by a Constrained Optimization System (that implements a constrained optimization algorithm).
  • It can range from being a Constrained Minimization Task to being a Constrained Maximization Task.
  • ...
• Example(s):
  • an Unconstrained Optimization Task.
  • a Linear Programming Task.
  • a Constrained Path Optimization Task.
• See: Constraint (Mathematics), Loss Function, Energy Function, Reward Function, Utility Function.

References

2015

• (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/constrained_optimization Retrieved:2015年11月8日.
  • In mathematical optimization, constrained optimization (in some contexts called constraint optimization) is the process of optimizing an objective function with respect to some variables in the presence of constraints on those variables. The objective function is either a cost function or energy function which is to be minimized, or a reward function or utility function, which is to be maximized. Constraints can be either hard constraints which set conditions for the variables that are required to be satisfied, or soft constraints which have some variable values that are penalized in the objective function if, and based on the extent that, the conditions on the variables are not satisfied.

• Concept