A generalized equilibrium optimization framework for multi-objective engineering systems
Keywords:
Multi-objective optimization, equilibrium problem, variational inequality, pareto optimality, strong monotonicity, convex analysis, engineering design, projected algorithm.Abstract
Multi-objective engineering design refers to the necessity of simultaneously optimizing contradicting performance parameters while being subjected to physical, operational, and resource constraint requirements. Most classical methods of scalarization mostly lead to compromise solutions without any sound equilibrium interpretation and convergence guarantees. A generalized equilibrium optimization framework is proposed that enables the representation of vector-valued engineering objectives by a regularized equilibrium operator defined over the closed convex feasible set. In the specific formulation, weighted and achievement-based scalarization methods can be incorporated via variational inequalities, normal cone inclusions, and Karush–Kuhn–Tucker conditions, allowing the definition of Pareto-optimal engineering decisions. Conditions for the existence of equilibrium solutions can be defined based on compactness and continuity conditions, while uniqueness can be proven based on the strict monotonicity of the equilibrium operator. A projected generalized equilibrium algorithm is proposed having stopping criteria based on the residuals and perform a convergence analysis. Finally, the execution of the proposed method is illustrated using three engineering examples, namely thermal equipment sizing, constrained power dispatching, and structural design. The thermal optimization achieved a compromise objective value of 0.218 with an equilibrium residual of 7.4×10⁻⁷, while the power dispatch model maintained exact generation balance with a residual of 8.1×10⁻⁷. The structural design case obtained a compromise value of 0.226 and residual of 6.9×10⁻⁷. According to the convergence analysis, it was revealed that during the 120 iterations the equilibrium objective was reduced from 0.842 to 0.218. Using either weighted projected gradient method or penalty projected gradient method the resulting level attained with the proposed approach was 0.218 achieved in only 120 iterations thus proving the least effective performance of the new framework due to its capacity to provide mathematically provable equilibrium consistency, stable convergence and interpretable trade-offs.
Downloads
Downloads
Published
Issue
Section
License
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.

