A new algorithm is developed to solve zero-one multiple objective problems in linear programming. Ten problems were selected at random and solved twice, once using the current algorithm and once using the newly developed one. The results (CPU time in micro-seconds) are as follows: Problem Current New

1 8.05 8.71
2 24.75 24.74
3 28.33 28.74
4 8.45 8.77
5 9.19 8.80
6 25.20 24.83
7 14.05 14.82
8 20.33 20.77
9 4.82 4.71
10 8.54 8.72

From the 99% confidence level, what would you conclude?

nlgqer

step-by-step

25/14 or 1.

step-by-step explanation:

the dots mean that it has infinitely more numbers behind it

delaney would like to make a 5lb nut mixture that is 60% peanuts and 40% almonds.

she has several pounds of peanuts and several pounds of a mixture that is 20% peanuts and 80% almonds.

let 'p' represent the number of pounds of peanuts needed to make the new mixture, and  

let 'm' represent the number of pounds of the 80% almond-20% peanut mixture.

:

p + m = 5

therefore

m = (5-p)

write an equation based on the percent of peanuts

1p + .2m = .6(5)

replace m with (5-p)

p + .2(5-p) = .6(5)

p + 1 - .2p = 3

p - .2p = 3 - 1

.8p = 2

p = 2/.8

p = 2.5 lbs of peanuts required

then

5 - 2.5 = 2.5 lbs of the peanut/almond mixture required

:

a) what is the system that models this situation?

p + m = 5

1p + .2m = .6(5)