Stability radius of an efficient solution to a vector quadratic problem of Boolean programming.
The main goal of this paper is to extend the result obtained earlier by the authors, finding the ranges of input parameters for a scalar problem in linear Boolean programming ensuring a unique optimal solution to the problem. A formula is presented for the stability radius of a Pareto optimal solution to a vector Boolean programming problem with quadratic partial criteria and linear constraints.
scientific article; zbMATH DE number 1849231