Stability radius of an efficient solution to a vector quadratic problem of Boolean programming. (Q1852516)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Stability radius of an efficient solution to a vector quadratic problem of Boolean programming. |
scientific article; zbMATH DE number 1849231
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stability radius of an efficient solution to a vector quadratic problem of Boolean programming. |
scientific article; zbMATH DE number 1849231 |
Statements
Stability radius of an efficient solution to a vector quadratic problem of Boolean programming. (English)
0 references
26 June 2003
0 references
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.
0 references
Boolean programming
0 references
vector criterion
0 references
efficient solution
0 references
Pareto set
0 references
optimal
0 references
unique
0 references
partial criteria
0 references
0.9160829782485962
0 references
0.9160829782485962
0 references
0.9065786600112916
0 references
0.9006386995315552
0 references
