Standard Form

A standard optimization problem is typically stated as follows:
\begin{aligned} p^* = \min_\limits{x} \quad & f_{0}(x) \\ \text{subject to:} \quad & f_{i}(x) \leq 0, \quad i=1,\ldots,m, \end{aligned}
where is the optimal value, is the decision variable, is the objective function (or cost), and are the optimization constraints.

Other than inequality constraints, an optimization problem may have equality constraints (equivalently represented via a pair of inequalities and ), and set constraints .

Furthermore, maximization problems can be readily recast as minimization problems, such that

"Subject To" Notation ” is sometimes replaced with the shorthand “,” or simply by colon notation “”.

In the above, the term “

Properties

(Feasible Set) .

The feasible set is the set of points that satisfy the constraints of an optimization problem. If , the problem is said to be infeasible, such that

(Optimal Set) .

If , then, naturally . However, the converse isn’t true. There may be feasible solutions to an optimization problem, but the optimal set is empty because:

  1. The optimal solution is at a limit (i.e., diverges at ).
  2. The constraints of the optimization problem are not satisfied.

(Sub-optimality) If and , then is -suboptimal.