Practical decision-making very often results in complex multiobjective optimization problems sugar daddy and sugar baby candy that can be solved only by advanced software.At present, it is available for singleobjective optimization and much less for multiobjective optimization.Therefore, the most common approach to multiobjective optimization is to reduce (scalarize) to its singleobjective optimization equivalent.
To this aim, the objectives are aggregated into a weighted (parametrized) sum of objectives.However, this form of scalarization does not guarantee that each Pareto optimal solution can be derived.We present a free web-based application to automate scalarizing multiobjective mixed integer optimization problems by a specific form of stewart copeland drumsticks scalarization, the process which can be tedious for large-scale instances.
This form of scalarization guarantees that every Pareto optimal solution is derivable.