Scribd
Upload
357 views

TST 2 Dynamic Programming

The document discusses two optimization problems that can be solved using dynamic programming. The first involves allocating five crates of strawberries between three grocery stores to maximize expected profit. The second involves assigning six volunteer workers to four precincts to maximize estimated votes for a political candidate. Dynamic programming can be used to determine the optimal allocation of crates between stores and workers between precincts.

Uploaded by

amelia
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
357 views

TST 2 Dynamic Programming

The document discusses two optimization problems that can be solved using dynamic programming. The first involves allocating five crates of strawberries between three grocery stores to maximize expected profit. The second involves assigning six volunteer workers to four precincts to maximize estimated votes for a political candidate. Dynamic programming can be used to determine the optimal allocation of crates between stores and workers between precincts.

Uploaded by

amelia
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

TUGAS SETELAH TUTORIAL

(ASSISTANT : RAHMI AULIA SYAFITRI)

1. The owner of a chain of three grocery stores 2. A county chairwoman of a certain political
has purchased five crates of fresh party is making plans for an upcoming
strawberries. The estimated probability presidential election. She has received the
distribution of potential sales of the services of six volunteer workers for
strawberries before spoilage differs among precinct work, and she wants to assign them
the three stores. Therefore, the owner wants to four precincts in such a way as to
to know how to allocate five crates to the maximize their effectiveness. She feels that
three stores to maximize expected profit. For it would be inefficient to assign a worker to
administrative reasons, the owner does not more than one precinct, but she is willing to
wish to split crates between stores. assign no workers to any one of the
However, he is willing to distribute no precincts if they can accomplish more in
crates to any of his stores. The following other precincts. The following table gives
table gives the estimated expected profit at the estimated increase in the number of
each store when it is allocated various votes for the party’s candidate in each
numbers of crates: precinct if it were allocated various numbers
of workers:

Use dynamic programming to determine


how many of the five crates should be
assigned to each of the three stores to This problem has several optimal solutions
maximize the total expected profit. for how many of the six workers should be
assigned to each of the four precincts
tomaximize the total estimated increase in
the plurality of the party’s candidate. Use
dynamic programming to find all of them so
the chairwoman can make the final selection
based on other factors.

DEADLINE
SATURDAY/ SEPTEMBER 16TH, 2017
15.09 WLPOSI
MAP BIOLA ORANGE

NO CHEATING !!!

You might also like