Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 235 views

    FALL2018DP1

    Uploaded by

    basri
    This document is a problem set for an operations research course. It contains two problems: 1) finding the shortest path from node 1 to node 10 in a given network using dynamic programming, and 2) determining where a sales representative should spend the first three days of the week to maximize earnings from sales minus travel costs based on given daily earnings and travel costs. It also lists two references for the course.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    FALL2018DP1

    Uploaded by

    basri
    235 views1 page
    This document is a problem set for an operations research course. It contains two problems: 1) finding the shortest path from node 1 to node 10 in a given network using dynamic programming, and 2) determining where a sales representative should spend the first three days of the week to maximize earnings from sales minus travel costs based on given daily earnings and travel costs. It also lists two references for the course.

    Original Description:

    Dynamic programming examples

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document is a problem set for an operations research course. It contains two problems: 1) finding the shortest path from node 1 to node 10 in a given network using dynamic programming, and 2) determining where a sales representative should spend the first three days of the week to maximize earnings from sales minus travel costs based on given daily earnings and travel costs. It also lists two references for the course.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    235 views1 page

    FALL2018DP1

    Uploaded by

    basri
    This document is a problem set for an operations research course. It contains two problems: 1) finding the shortest path from node 1 to node 10 in a given network using dynamic programming, and 2) determining where a sales representative should spend the first three days of the week to maximize earnings from sales minus travel costs based on given daily earnings and travel costs. It also lists two references for the course.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    Industrial Engineering

    INE3009 Operations Research II


    Fall 2018

    Problem Set 5
    th
    7 November, 2018
    1. Find the shortest path from node 1 to node 10 in the network shown in Figure 1 via dynamic
    programming.

    Figure 1: Network for Problem 1

    2. A sales representative lives in Bloomington and must be in Indianapolis next Thursday. On


    each of the days Monday, Tuesday and Wednesday, he can sell his wares in Indianapolis, Bloom-
    ington or Chicago. From past experience, he believes that he can earn $12 from spending a
    day in Indianapolis, $16 from spending a day in Bloomington and $17 from spending a day in
    Chicago.Where should he spend the first three days and nights of the week to maximize his sales
    income less travel costs? Travel costs are shown in Table 1.

    Table 1: Travel costs

    To
    From Indianapolis Bloomington Chicago
    Indianapolis - $5 $2
    Bloomington $5 - $7
    Chicago $2 $7 -

    References:
    1) Winston, Wayne L., and Jeffrey B. Goldberg. 2004. Operations research: applications and algo-
    rithms. Belmont, CA: Thomson/Brooks/Cole.
    2) Taha, Hamdy A. 2006. Operations Research: An Introduction (8th Edition) Prentice-Hall, Inc.
    Upper Saddle River, NJ, USA.

    You might also like