This article addresses the derivation of a Euclidean center, which is defined as the point in decision space from which one can inscribe the largest sphere contained by the constraints. We extend this concept by introducing its weighted version, which we term the weighted Euclidean center. We show that by assigning weights to the different decision variables we can traverse the entire decision space. In addition, we show that the concept of a weighted Euclidean center and that of the achievement scalarizing function introduced by Wierzbicki are intimately related.
- Achievement scalarizing function
- Euclidean centers
- Multiple-objective linear programming (MOLP)