CORTEXA
← Browse
arxivmath.OCcs.CEcs.NE2026-06-26

Comparing Scalar Objective Functions for Multi-Criteria Engineering Optimization

Olaf Frommann

Scalar objective functions are required when a multi-criteria optimization problem must yield a single preferred design rather than only a Pareto set. The choice of scalarization influences which compromise is selected, how preference parameters are interpreted, and whether non-supported Pareto regions can be reached. This paper compares four formulations for normalized bi-criteria minimization: weighted sums, achievement scalarizing functions, desirability functions, and a fuzzy-logic-based formulation. Two analytically defined Pareto fronts, one convex and one concave, isolate the effect of the objective formulation from numerical optimizer behavior. The comparison focuses on reachable Pareto regions, parameter-induced selection density, compensation between criteria, sensitivity, and interpretability. Results show that weighted sums are simple but structurally limited on concave fronts, while achievement, desirability, and fuzzy formulations reach interior non-supported regions through different mechanisms. Desirability functions introduce nonlinear single-criterion preference mappings, whereas fuzzy rules express nonseparable and reference-dependent engineering preferences.

View free PDFSource page

Related papers

arxivcs.CEcs.AImath.OCq-fin.PMq-fin.RM2026-07-10

Large-Scale Portfolio Optimization Problem Under Cardinality Constraint With Enhanced Multi-Objective Evolutionary Algorithms

Danial Ramezani, Mostafa Abouei Ardakan

Decision-making is posing an increasingly formidable challenge to investors because of the growing number of alternatives available in financial markets. A hot area of research over the past few decades has been portfolio optimization that seeks to determine how much an investor…

View free PDFSource page
arxivcs.DMcs.NEmath.OC2026-07-13

Representing the Non-dominated Set of Multi-objective Network Problems by Supported Non-dominated Points

David Könen, Lara Löhken, Michael Stiglmayr

In multi-objective combinatorial optimization, unsupported non-dominated points typically outnumber supported points and are often significantly more challenging to compute. Recent studies show that extreme supported non-dominated points provide high-quality representations of th…

View free PDFSource page
arxivcs.NEcs.CE2026-07-08

Sampling on Random Subspaces under Limited Data in the Context of Exploratory Landscape Analysis

Iván Olarte Rodríguez, Anja Jankovic, Thomas Bäck, Elena Raponi

Classical space-filling designs often fail to provide reliable statistical results for Exploratory Landscape Analysis (ELA) when only limited evaluation budgets are available, as commonly occurs in high-dimensional problems or other resource-constrained settings, resulting in noi…

View free PDFSource page
arxivcs.CEeess.SYmath.OC2026-07-01

Generalized Normal Constraint (GNC): A Complete Geometric Generalization of the NNC Method

Achille Messac, Blayne Montaque

This paper presents a unified geometric, mathematical, and computational framework for the generation of the $complete$ admissible Pareto frontier. Several existing methods are structurally unable to capture the complete admissible Pareto frontier. These include widely used metho…

View free PDFSource page
arxivcs.CEcs.ROmath.OC2026-07-09

Impedance-Guided Programmable Transmission of Localized Deformation in Modular Soft Metamaterials

Weiyun Xu, Daewon Hong, Zhi Zhao, Rahul Dev Kundu, Xiaojia Shelly Zhang

Soft metamaterials provide a promising platform for robotics, biomedical devices, and flexible electronics. The localized mechanical responses by nonuniform excitation are ubiquitous in soft materials, yet their controlled transmission across assemblies remains largely overlooked…

View free PDFSource page