A hybrid algorithm for solving a polynomial zeroone mathematical program was presented in IIE Transactions (June 1990).

Question:

A hybrid algorithm for solving a polynomial zero–one mathematical program was presented in IIE Transactions (June 1990). The algorithm incorporates a mixture of pseudo-Boolean concepts and time-proven implicit enumeration procedures. Twenty five random problems were solved using the hybrid algorithm; the times to solution (CPU time in seconds) are listed in the next table. Conduct a test to determine if more than half of random polynomial zero–one mathematical problems will require a solution time of 1 CPU second or less. Use α = .01.