Question

The cafeteria of a prominent university in Carson, California hires students to assist in its three shifts of operations: breakfast, lunch, and dinner. In order to provide good customer service, the cafeteria has a policy that the number of students hired for the lunch shift must exactly equal (no more and no less) to the combined total number of students hired for the other two (that is, breakfast AND dinner) shifts. Based on these information, if Bis the number of students hired for the breakfast shift, L is the number of students hired for the lunch shift, and is the number of students hired for the dinner shift, then the constraint used in a Linear Programming (LP) problem to describe this situation is :________

A. B = L + D
B. L - B + D
C. D - B + L
D. Not enough information given to answer this question
E. None of the above please continue on the next page

Answer 1

B. L - B + D

Step-by-step explanation:

There are three different shifts of operation, Lunch, breakfast and dinner. The liner programming constraint is that lunch total must be equal to the sum of other two shifts. The constraint equation is formed to identify the number of students need to be hired for each shift.