Problem statement and examples
In this course we will deal with optimization problems. Such problems appear in many practical settings in almost all aspects of science and engineering. Mathematically, we can write the problem as
min subject to subject to
f (x) ci(x) = 0 hi(x) ≥ 0
i = 1, . . . , nE i = 1, . . . , nI
Where x is an n dimensional vector and the function f : Rn → R1 is called the objective function. The ci are called equality constraints and hi are inequality constraints. Our goal is to find the vector x that solves (1.1) assuming that such solution exist. For most applications we assume that f, ci and hi are twice differentiable.
Example 1 Minimization of a function in 1D Let f(x) = x2 then an obvious solution is x = 0. If we add the inequality constraint h(x) =
1 ≥ 0 then the solution is x = 1.
If on the other hand we add the inequality constraint
h(x) = x + 1 ≥ 0 constraints and we
then, the obtain x
solution is the same us the solution of = 0. We see that given an inequality
the problem with no constraint, it can be
active or inactive. Finally, consider the case h1(x) = x
1 ≥ 0 and h2(x) =
x ≥ 0. In this case we
see that the constraints are inconsistent and the problem has no solution.
Example 2 Data fitting