@misc{Libura_Marek_Adjustment_2002,
 author={Libura, Marek},
 copyright={Creative Commons Attribution BY 4.0 license},
 address={Warszawa},
 journal={Raport Badawczy = Research Report},
 howpublished={online},
 year={2002},
 publisher={Instytut Badań Systemowych. Polska Akademia Nauk},
 publisher={Systems Research Institute. Polish Academy of Sciences},
 language={eng},
 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.},
 title={Adjustment problem for binary constrained linear programming problems},
 type={Text},
 URL={http://www.rcin.org.pl/Content/139417/PDF/RB-2002-66.pdf},
 keywords={Linear programming, Adjustment problem, Programowanie liniowe, Problem z dostosowaniem},
}