Title:

Adjustment problem for binary constrained linear programming problems

Subtitle:

Raport Badawczy = Research Report ; RB/66/2002

Creator:

Libura, Marek

Publisher:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Place of publishing:

Warszawa

Date issued/created:

2002

Description:

17 pages ; 21 cm ; Bibliography p. 10-11

Subject and Keywords:

Linear programming ; Adjustment problem ; Programowanie liniowe ; Problem z dostosowaniem

Abstract:

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.

Relation:

Raport Badawczy = Research Report

Resource type:

Text

Detailed Resource Type:

Report

Source:

RB-2002-66

Language:

eng

Language of abstract:

eng

Rights:

Creative Commons Attribution BY 4.0 license

Terms of use:

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: ; -

Digitizing institution:

Systems Research Institute of the Polish Academy of Sciences

Original in:

Library of Systems Research Institute PAS

Projects co-financed by:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

Access:

Open