@misc{Libura_Marek_On_2006, author={Libura, Marek}, copyright={Creative Commons Attribution BY 4.0 license}, address={Warszawa}, journal={Raport Badawczy = Research Report}, howpublished={online}, year={2006}, publisher={Instytut BadaƄ Systemowych. Polska Akademia Nauk}, publisher={Systems Research Institute. Polish Academy of Sciences}, language={eng}, abstract={The paper proposes a generalization of the inverse problem which was called the adjustment problem. For an optimization problem with linear objective function and its restriction defined by a given subset of feasible solutions, the adjustment problem consists in finding the least costly perturbations of the original objective function coefficients, which guarantee that an optimal solution of the perturbed problem is also feasible for the considered restriction. The method of solving the adjustment problem for continuous linear programming problems when variables in the restriction are required to be binary is described.}, title={On the adjustment problem for linear programs}, type={Text}, URL={http://www.rcin.org.pl/Content/139692/PDF/RB-2006-18.pdf}, keywords={Combinatorial optimization, Linear programming, Inverse optimization, Adjustment problem, Optymalizacja kombinatoryczna, Programowanie liniowe, Optymalizacja odwrotna}, }