Next: Optimization Algorithms
Up: Constrained
Previous: Constrained
  Contents
Given the problem 4.3, it is possible to
define
as the ideal outcome of the cost function
without any constraints,
so that
; the
compromise solution is defined as the minimum of regret:
typically, the
-norm (the distance between the actual
solution and the ideal point)
) it is used:
Again, a weight can be associated for each term of the sum:
Definition 5.26 (Compromise solution)
The compromise solution with respect to

-norm
is

that minimizes

over

.
The compromise solution enjoys several properties, the most important is:
Property 5.27 (Pareto optimality)
The compromise solution

is an N-point, for

with respect to
Pareto preference (definition
4.20).
If

is unique, then it is also an N-point.
When the ideal point is not known, one can use an approximation, or,
even, a constraint; in the latter case the more appropriate term is
satisfying level.
To point out the differences between constraints and satisfying level,
one must observe:

- The constraints are, typically, a disequality constraints:
the solution must be as lesser as possible than the specified constraints.
In term of a
-norm the solution must be as farther as
possible from the constraints, that is the
-norm must not to
be minimized.
So the method of the penalty function is the only
suitable for this kind of problem.

- The satisfying levels are, typically, equality constraints:
the solution must be as closer as possible to the levels indicated, that is
the
-norm must be minimized. So the method of the
compromise solution can be devised.
Next: Optimization Algorithms
Up: Constrained
Previous: Constrained
  Contents
marco+site@equars.com