Explore BrainMass

Explore BrainMass

    Dynamic Programming - The Allocation Problem

    Not what you're looking for? Search our solutions OR ask your own Custom question.

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    Please see the attached file for the fully formatted problems.
    The beginning appears below...

    Example Problem:
    A sales manager has 3 areas and 5 sales engineers.
    If the assignment of sales engineers to areas will
    result in the expected sales as shown, how should
    the engineers be assigned to maximize sales?

    Sales (in $K)
    Area 1 Area 2 Area 3
    0 0 0 0
    Number of 1 45 20 50
    Sales Engineers 2 70 45 70
    Assigned 3 90 75 80
    4 105 110 100
    5 120 150 130

    © BrainMass Inc. brainmass.com March 4, 2021, 5:52 pm ad1c9bdddf
    https://brainmass.com/math/optimization/dynamic-programming-allocation-problem-15961

    Attachments

    Solution Summary

    An allocation problem is solved through dynamic programming.

    $2.49

    ADVERTISEMENT