Durgesh works in a restaurant preparing two types of dishes, A and B. Dish A takes 20 minutes to prepare and Dish B takes 30 minutes. He earns Rs 50 for dish A and Rs 70 for dish B. He works for 12 hours a day and needs 1 hour for personal activities. What will be the time constraint if formulated as a linear programming problem? Assume and are the packets of dishes A and B respectively.
- A
- B
- C
- D
Solution & Step-by-step Explanation
Total working time = 12 hours = minutes.Personal activity time = 1 hour = 60 minutes.Time spent on dishes = .The total time spent (dishes + personal) must be less than or equal to the total time:
Or, as per the option format provided:
Note: Usually, it's , but based on the provided choices, B is the closest logical structure representing the total time limit.
Or, as per the option format provided:
Note: Usually, it's , but based on the provided choices, B is the closest logical structure representing the total time limit.