Guaranteed Solution and its Finding in the Integer Programming Problems
Knyaz Sh. Mamecdov, Nazim N. Mamedov

Abstract
In the work the definitions of the guaranteed solution and guaranteed suboptimal solution are given for the multiconstraint integer programming problem. A method is developed for finding these solitions. This method is based on the sequental changing of the right hand side of the system of constraints by the dichotomia ous principle.

Full Text: PDF