Weighting method for non-preemptive multi-objective mathematical programming

DOI10.1007/S10589-025-00762-0MaRDI QIDQ7240388zbMATH OpenFDO

Authors L. Ferro, Gianluca Filaci, Andrea Manzini, Antonio Ornatelli

Publication date 11 May 2026

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10589-025-00762-0

zbMATH Keywords

lexicographic optimizationmathematical programmingmultiple objective programmingnon-preemptive method

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• A dual-based algorithm for solving lexicographic multiple objective programs
• An enhanced conversion scheme for lexicographic, multiobjective integer programs
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
• Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm
• On the transformation of lexicographic nonlinear multiobjective programs to single objective programs
• Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
• Sensitivity analysis on the priority of the objective functions in lexicographic multiple objective linear programs
• Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology
• The weighted sum method for multi-objective optimization: new insights

This page was built for publication: Weighting method for non-preemptive multi-objective mathematical programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7240388)