Stochastic knapsack problem

Keith Ross, Danny H K Tsang

    Research output: Contribution to journalArticle

    Abstract

    The problem of packing a knapsack of integer volume F with objects from K different classes to maximize profit is studied. Optimization is carried out over the class of coordinate convex policies. For the case of K +32 +0 2, it is shown for a wide range of parameters that the optimal control is of the threshold type. In the case of Poisson arrivals and of knapsack and object volumes being integer multiples of each other, it is shown that the optimal policy is always of the double-threshold type. An O(F) algorithm to determine the revenue of threshold policies is also given. For the general case of K classes, the problem of the optimal static control where for each class a portion of the knapsack is dedicated is considered. An efficient finite-stage dynamic programming algorithm for locating the optimal static control is presented. Furthermore, variants of the optimal static control which allow some sharing among classes are also discussed.

    Original languageEnglish (US)
    Pages (from-to)740-747
    Number of pages8
    JournalIEEE Transactions on Communications
    Volume37
    Issue number7
    StatePublished - Jul 1989

    Fingerprint

    Dynamic programming
    Profitability

    ASJC Scopus subject areas

    • Engineering(all)

    Cite this

    Ross, K., & Tsang, D. H. K. (1989). Stochastic knapsack problem. IEEE Transactions on Communications, 37(7), 740-747.

    Stochastic knapsack problem. / Ross, Keith; Tsang, Danny H K.

    In: IEEE Transactions on Communications, Vol. 37, No. 7, 07.1989, p. 740-747.

    Research output: Contribution to journalArticle

    Ross, K & Tsang, DHK 1989, 'Stochastic knapsack problem', IEEE Transactions on Communications, vol. 37, no. 7, pp. 740-747.
    Ross K, Tsang DHK. Stochastic knapsack problem. IEEE Transactions on Communications. 1989 Jul;37(7):740-747.
    Ross, Keith ; Tsang, Danny H K. / Stochastic knapsack problem. In: IEEE Transactions on Communications. 1989 ; Vol. 37, No. 7. pp. 740-747.
    @article{38517022b5414ffa93bbd31ada78cbe6,
    title = "Stochastic knapsack problem",
    abstract = "The problem of packing a knapsack of integer volume F with objects from K different classes to maximize profit is studied. Optimization is carried out over the class of coordinate convex policies. For the case of K +32 +0 2, it is shown for a wide range of parameters that the optimal control is of the threshold type. In the case of Poisson arrivals and of knapsack and object volumes being integer multiples of each other, it is shown that the optimal policy is always of the double-threshold type. An O(F) algorithm to determine the revenue of threshold policies is also given. For the general case of K classes, the problem of the optimal static control where for each class a portion of the knapsack is dedicated is considered. An efficient finite-stage dynamic programming algorithm for locating the optimal static control is presented. Furthermore, variants of the optimal static control which allow some sharing among classes are also discussed.",
    author = "Keith Ross and Tsang, {Danny H K}",
    year = "1989",
    month = "7",
    language = "English (US)",
    volume = "37",
    pages = "740--747",
    journal = "IEEE Transactions on Communications",
    issn = "0090-6778",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "7",

    }

    TY - JOUR

    T1 - Stochastic knapsack problem

    AU - Ross, Keith

    AU - Tsang, Danny H K

    PY - 1989/7

    Y1 - 1989/7

    N2 - The problem of packing a knapsack of integer volume F with objects from K different classes to maximize profit is studied. Optimization is carried out over the class of coordinate convex policies. For the case of K +32 +0 2, it is shown for a wide range of parameters that the optimal control is of the threshold type. In the case of Poisson arrivals and of knapsack and object volumes being integer multiples of each other, it is shown that the optimal policy is always of the double-threshold type. An O(F) algorithm to determine the revenue of threshold policies is also given. For the general case of K classes, the problem of the optimal static control where for each class a portion of the knapsack is dedicated is considered. An efficient finite-stage dynamic programming algorithm for locating the optimal static control is presented. Furthermore, variants of the optimal static control which allow some sharing among classes are also discussed.

    AB - The problem of packing a knapsack of integer volume F with objects from K different classes to maximize profit is studied. Optimization is carried out over the class of coordinate convex policies. For the case of K +32 +0 2, it is shown for a wide range of parameters that the optimal control is of the threshold type. In the case of Poisson arrivals and of knapsack and object volumes being integer multiples of each other, it is shown that the optimal policy is always of the double-threshold type. An O(F) algorithm to determine the revenue of threshold policies is also given. For the general case of K classes, the problem of the optimal static control where for each class a portion of the knapsack is dedicated is considered. An efficient finite-stage dynamic programming algorithm for locating the optimal static control is presented. Furthermore, variants of the optimal static control which allow some sharing among classes are also discussed.

    UR - http://www.scopus.com/inward/record.url?scp=0024701285&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0024701285&partnerID=8YFLogxK

    M3 - Article

    VL - 37

    SP - 740

    EP - 747

    JO - IEEE Transactions on Communications

    JF - IEEE Transactions on Communications

    SN - 0090-6778

    IS - 7

    ER -