Stability radius of an efficient solution to a vector quadratic problem of Boolean programming.
type: Item
instance of: scholarly article
title: Stability radius of an efficient solution to a vector quadratic problem of Boolean programming.
zbMATH Open document ID: 1047.90061
published in: Computational Mathematics and Mathematical Physics
publication date: 2003-06-26T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 58E17
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 91B50
zbMATH DE Number: 1849231
zbMATH Keywords: Boolean programming
zbMATH Keywords: vector criterion
zbMATH Keywords: efficient solution
zbMATH Keywords: Pareto set
zbMATH Keywords: optimal
zbMATH Keywords: unique
zbMATH Keywords: partial criteria
author: V. A. Emelichev
author: Vitaly N. Krichko
reviewed by: A. Tret'yakov
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1849231