Title :
Methods of constructing suboptimal solution of multiple Mixed-Boolean programming problems
Author :
Mammadov, K. ; Nagiyeva, S. ; Veliyev, H.
Author_Institution :
Cybern. Inst., Baku, Azerbaijan
Abstract :
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.
Keywords :
Boolean functions; mathematical programming; approximate solution; multiple mixed-Boolean programming; suboptimal solution; mixed-Boolean Programming Problem; nonlinear penalty; suboptimal solution; upper and low bound of optimal value;
Conference_Titel :
Problems of Cybernetics and Informatics (PCI), 2012 IV International Conference
Conference_Location :
Baku
Print_ISBN :
978-1-4673-4500-2
DOI :
10.1109/ICPCI.2012.6486468
