On accuracy, robustness and tolerances in vector Boolean optimization

• Published in: European journal of operational research Vol. 224; no. 3; pp. 449 - 457
• Main Authors: Nikulin, Y., Karelkina, O., Mäkelä, M.M.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.02.2013; Elsevier; Elsevier Sequoia S.A
• Subjects: Accuracy function; Boolean; Cost analysis; Mathematical functions; Mathematical problems; Mathematical programming; Pareto optimum; Robust measure; Studies; Tolerances; Worst-case relative regret; Accuracy function; Tolerances; Robust measure; Pareto optimum; Worst-case relative regret
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/j.ejor.2012.09.018

► We formulated the concepts of accuracy functions and robustness tolerances in vector Boolean optimization. ► We specified analytical expressions and computable bounds for major concepts. ► We made a comparison of robust optimization approaches with sensitivity analysis tools. ► We illustrated the basic concepts using numerical examples. A Boolean programming problem with a finite number of alternatives where initial coefficients (costs) of linear payoff functions are subject to perturbations is considered. We define robust solution as a feasible solution which for a given set of realizations of uncertain parameters guarantees the minimum value of the worst-case relative regret among all feasible solutions. For the Pareto optimality principle, an appropriate definition of the worst-case relative regret is specified. It is shown that this definition is closely related to the concept of accuracy function being recently intensively studied in the literature. We also present the concept of robustness tolerances of a single cost vector. The tolerance is defined as the maximum level of perturbation of the cost vector which does not destroy the solution robustness. We present formulae allowing the calculation of the robustness tolerance obtained for some initial costs. The results are illustrated with several numerical examples.