There are two queues at a supermarket billing counter. In the first queue there are m1 customers all with n1 items in their baskets, while in the second queue there are m2 customers all with n2 items in their baskets. It takes t seconds to process each item and p seconds for each person to pay. A customer wishes to know which queue to join.
Which one of these options gives the condition for the first queue to be the better queue to join?
A. m1(p+n1t) = m2(p+n2t)

B. m1(p+n1t)

• q1=m1(p+n1t)
  q2=m2(p+n2t)
  m1(p+n1t)< m2(p+n2t) is the only condition which satisfies the given condition(q1
• 11 years agoHelpfull: Yes(26) No(4)
• A. m1(p+n1t) = m2(p+n2t)
• 10 years agoHelpfull: Yes(2) No(0)
• Firstly for 1st queue, times to scan quantity is t*n1
  then time required for each man is p+tn1
  total time required m1*(p+n1t)
  For 2nd queue it will be m2*(p+n2t)
  it is possible only if n1
• 11 years agoHelpfull: Yes(1) No(0)
• Firstly for 1st queue, times to scan quantity is t*n1
  then time required for each man is p+tn1
  total time required m1*(p+n1t)
  
  similarly For 2nd queue it will be m2*(p+n2t)
  
  now 1st queue will be better option to choose only when the time required in 1st queue will be less than the time required in 2nd queue so,
  m1*(p+n1t) < m2*(p+n2t)
• 9 years agoHelpfull: Yes(1) No(0)
• Total number of items first queue= m1*n1
  " " second queue= m2*n2
  time for first queue=m1*n1*t+m1*p
  " second " =m2*n2*t+m2*p
  better condition 1st queue=(m1*n1*t+m1*p)
• 11 years agoHelpfull: Yes(0) No(5)
• (m1*n1*t+m1*p)
• 11 years agoHelpfull: Yes(0) No(4)
• Answer is: m1(p+n1t)
• 11 years agoHelpfull: Yes(0) No(5)
• Firstly for 1st queue, times to scan quantity is t*n1
  then time required for each man is p+tn1
  total time required m1*(p+n1t)
  
  similarly For 2nd queue it will be m2*(p+n2t)
  
  now 1st queue will be better option to choose only when the time required in 1st queue will be less than the time required in 2nd queue so,
  m1*(p+n1t) < m2*(p+n2t)
• 8 years agoHelpfull: Yes(0) No(0)