Question: A hybrid algorithm for solving a polynomial zeroone mathematical program was presented in IIE Transactions (June 1990). The algorithm incorporates a mixture of pseudo-Boolean concepts
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.

PU .045 1.055 .136 1.894 .379 .136 .336 .258 1.070 .506 .088 .242 1.639 .912 .412 .361 8.788 .579 1.267 .567 .182 .036 .394 .209 .445
Step by Step Solution
3.44 Rating (167 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
