On accuracy, robustness and tolerances in vector Boolean optimization

DOI10.1016/J.EJOR.2012.09.018MaRDI QIDQ2253450zbMATH OpenOpenAlexFDO

Authors Marko M. Mäkelä, Yury Nikulin, Olga V. Karelkina

Publication date 27 July 2014

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2012.09.018

zbMATH Keywords

Pareto optimumaccuracy functiontolerancesrobust measureworst-case relative regret

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Boolean programming (90C09)

Recommendations

• Robustness in deterministic vector optimization
• scientific article; zbMATH DE number 3874955
• A vector method for the minimization of Boolean functions of several variables
• Characterizations of multiobjective robustness on vectorization counterparts
• A note on robustness tolerances for combinatorial optimization problems
• Robust counterparts and robust efficient solutions in vector optimization under uncertainty
• Sensitivity analysis of efficient solution in vector MINMAX Boolean programming problem
• Sensitivity analysis of efficient solution in vector MINMAX Boolean programming problem
• Boolean Methods of Optimization over Independence Systems
• Tolerances, robustness and parametrization of matrix properties related to optimization problems

Cited in

(3)

• On one type of stability for multiobjective integer linear programming problem with parameterized optimality
• Finite games with perturbed payoffs
• On the quasistability radius for a multicriteria integer linear programming problem of finding extremum solutions

This page was built for publication: On accuracy, robustness and tolerances in vector Boolean optimization

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