Problem 3 Dr. Tanner's oldest two children want to divide their chores (load dishwasher, sweep after dinner, clean bedroom, and vacuum living room) between them so that each has only two chores but the total time they spend on chores is kept to a minimum. The time in minutes per week for each chore is given below: Child load dishwasher sweep after dinner clean bedroom vacuum living room Vivi 30 40 60 30 Gwen 40 40 40 30 Loading the diswasher and sweeping are after dinner chores. Cleaning the bedroom and vacuuming the living room are weekend chores. Neither child wants to do both dinner chores or both weekend chores. Formulate a binary linear program that minimizes the total time spent on chores. Make sure to clearly define all decision variables used. Do not solve.
Added by Andr-S D.
Close
Step 1
Let's define the decision variables as follows: - x1: 1 if Vivi loads the dishwasher, 0 otherwise - x2: 1 if Vivi sweeps after dinner, 0 otherwise - x3: 1 if Vivi cleans the bedroom, 0 otherwise - x4: 1 if Vivi vacuums the living room, 0 otherwise - x5: 1 if Gwen Show more…
Show all steps
Your feedback will help us improve your experience
Akash M and 91 other Principles of Accounting educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Recommended Videos
'A young couple; Eve and Steven want to divide their main household chores (marketing; cooking; dish washing; and laundering) between them so that the difference between time each spend on household duties less than or equal hours: Marketing and cooking are mutually exclusive; i.e , both tasks cannot be assigned to same person: They want to assign tasks to minimize the total time spend on all chores. Their efficiencies on these tasks differ, where the time each would need to perform the task is given by the following table: Time needed per week (hours) Marketing Cooking Dish washing Laundry Eve 3.5 6.8 3.6 3.9 Steven 3.9 6.2 4.3 4.1 Formulate the problem (define decision variables clearly and formulate objective function and constraints) and solve by excel solver.'
Sri K.
Appletree Cleaning has five maids. To complete cleaning my house, they must vacuum, clean the kitchen, clean the bathroom, and do general straightening up. The time it takes each maid to do each job is shown in Table. Each maid is assigned one job. Use the Hungarian method to determine assignments that minimize the total number of maid-hours needed to clean my house. (Hint: Remember that assignment problem is a balanced transportation problem. So, check if the table is balanced or not. If it is not, then balance the table to use Hungarian Method)
Housecleaning. Sally can clean the house in 6 hours, her father can clean the house in 4 hours, and her younger brother, Dennis, can completely mess up the house in 8 hours. If Sally and her father clean and Dennis plays, how long will it take to clean the house?
Rational Expressions and Equations
Problem Solving Using Rational Equations
Recommended Textbooks
Horngren’s Cost Accounting
Cost Accounting A Managerial Emphasis
Principles of Accounting Volume 1: Financial Accounting
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD