Metadata language
On the robustness of optimal solutions for combinatorial optimization problems
Subtitle:Raport Badawczy = Research Report ; RB/2/2007
Creator: Publisher:Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
Place of publishing: Date issued/created: Description:16 stron ; 21 cm ; Bibliografia s. 15-16
Subject and Keywords:Combinatorial optimization ; Optymalizacja kombinatoryczna ; Robustness and sensitivity analysis ; Robustness radius
Abstract:The paper considers so-called generic combinatorial optimization problem, where the set of feasible solutions is some family of subsets of a finite ground set with specified positive initial weights of elements, and the objective function represents the total weight of elements of a feasible solution. It is assumed that the weights of all elements may be perturbed simultaneously and independently up to a given percentage of their initial values. A feasible solution, which minimizes then the worst-case relative regret, is called a robust solution. The maximum percentage level of perturbations, for which an initially optimal solution remains robust, is called the robustness radius of this solution. In this paper the robustness aspect of initially optimal solutions and provide lower bounds for their robustness radii are studied.
Relation:Raport Badawczy = Research Report
Resource type: Detailed Resource Type: Source: Language: Language of abstract: Rights:Licencja Creative Commons Uznanie autorstwa 4.0
Terms of use:Zasób chroniony prawem autorskim. [CC BY 4.0 Międzynarodowe] Korzystanie dozwolone zgodnie z licencją Creative Commons Uznanie autorstwa 4.0, której pełne postanowienia dostępne są pod adresem: ; -
Digitizing institution:Instytut Badań Systemowych Polskiej Akademii Nauk
Original in:Biblioteka Instytutu Badań Systemowych PAN
Projects co-financed by: Access: