# Question: A young couple Eve and Steven want to divide their

A young couple, Eve and Steven, want to divide their main household chores (marketing, cooking, dishwashing, and laundering) between them so that each has two tasks but the total time they spend on household duties is kept to a minimum. Their efficiencies on these tasks differ, where the time each would need to perform the task is given by the following table:

(a) Formulate a BIP model for this problem.

(b) Display this model on an Excel spreadsheet.

(c) Use the computer to solve this model.

(a) Formulate a BIP model for this problem.

(b) Display this model on an Excel spreadsheet.

(c) Use the computer to solve this model.

**View Solution:**## Answer to relevant Questions

An increasing number of Americans are moving to a warmer climate when they retire. To take advantage of this trend, Sunny Skies Unlimited is undertaking a major real estate development project. The project is to develop a ...Follow the instructions of Prob. 12.5-2 for the following IP problem: Maximize Z = 220x1 + 80x2, Subject to and x1 ≥ 0, x2 ≥ 0 x1, x2 are integers. Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively: Maximize Z = 5x1 + 5x2 + 8x3 – 2x4 – 4x5, Subject to and xj is binary, for j = 1, 2, . . . , 5. Consider the following IP problem: Maximize Z = –3x1 + 5x2, Subject to 5x1 – 7x2 ≥ 3 and xj ≤ 3 xj ≥ 0 xj is integer, for j = 1, 2. (a) Solve this problem graphically. (b) Use the MIP branch-and-bound algorithm ...Use the MIP branch-and-bound algorithm presented in Sec. 12.7 to solve the following MIP problem interactively: Minimize Z = 5x1 + x2 + x3 + 2x4 + 3x5, Subject to and xj ≥ 0, for j = 1, 2, 3, 4, 5 xj is integer, for j = 1, ...Post your question