Methods of constructing suboptimal solution of multiple Mixed-Boolean programming problems

In the article it was offered two methods for finding of approximate solution of mixed-Boolean programming problems with many restrictions. These methods are based on certain criterion which takes into account an economical entity of problem. Computational experiments that fulfilled on different problem shows, solutions that got in these methods don't differ from optimal solution so much.