Advanced search
Advanced search
Advanced search
Advanced search
Advanced search
Raport Badawczy = Research Report ; RB/66/2002
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
17 pages ; 21 cm ; Bibliography p. 10-11
In this paper the adjustment problem corresponding to linear programming problems with explicit or implicit binary contstraints is considered. It consists in finding less costly perturbations of weights in the original problem, wich guarantee that the optimal solution of the petrturbed problem, belongs to the specified subset of feasible solutions. We propose a method of solving problems of this type. The approach is based on using optimality conditions for corresponding linear programming relaxation.
Raport Badawczy = Research Report
Creative Commons Attribution BY 4.0 license
Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -
Systems Research Institute of the Polish Academy of Sciences
Library of Systems Research Institute PAS
Oct 19, 2021
Sep 17, 2020
33
https://rcin.org.pl./publication/174846
Edition name | Date |
---|---|
RB-2002-66 : Libura Marek Sylwester : Adjustment problem for binary constrained linear programming problems | Oct 19, 2021 |
Domaszewski, Maciej
Domaszewski, Maciej
Kacprzyk, Janusz (1947– ) Kiwiel, Krzysztof
Szkatuła, Krzysztof Tretyakov, Antonina
Libura, Marek
Libura, Marek