# Question

Consider an electronic system consisting of four components, each of which must work for the system to function. The reliability of the system can be improved by installing several parallel units in one or more of the components. The following table gives the probability that the respective components (labeled as Comp. 1, 2, 3, and 4) will function if they consist of one, two, or three parallel units:

The probability that the system will function is the product of the probabilities that the respective components will function.

The cost (in hundreds of dollars) of installing one, two, or three parallel units in the respective components (labeled as Comp. 1, 2, 3, and 4) is given by the following table:

Because of budget limitations, a maximum of $1,000 can be expended.

Use dynamic programming to determine how many parallel units should be installed in each of the four components to maximize the probability that the system will function.

The probability that the system will function is the product of the probabilities that the respective components will function.

The cost (in hundreds of dollars) of installing one, two, or three parallel units in the respective components (labeled as Comp. 1, 2, 3, and 4) is given by the following table:

Because of budget limitations, a maximum of $1,000 can be expended.

Use dynamic programming to determine how many parallel units should be installed in each of the four components to maximize the probability that the system will function.

## Answer to relevant Questions

Consider the following integer nonlinear programming problem. Maximize Z = 3x21 – x31 + 5x22 – x32, Subject to x1 + 2x2 ≤ 4 and Sue dynamic programming to solve this problem. Consider the two-variable IP example discussed in Sec. 12.5 and illustrated in Fig. 12.3. (a) Use a binary representation of the variables to reformulate this model as a BIP problem. 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 ...Follow the instructions of Prob. 12.5-2 for the following BIP problem: Maximize Z = –5x1 + 25x2, Subject to and x1, x2 are binary. Five jobs need to be done on a certain machine. However, the setup time for each job depends upon which job immediately preceded it, as shown by the following table: The objective is to schedule the sequence of jobs that ...Post your question

0