Stochastic knapsack problem

Keith Ross, Danny Tsang

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    The authors consider a knapsack with integer volume F which is capable of holding K different classes of objects. An object from class-k has integer volume bk, k = 1,...,K. Objects arrive randomly to the knapsack; interarrivals are exponential with mean depending on the state of the system. The sojourn time of an object has a general class-dependent distribution. An object in the knapsack from class-k accrues revenue at a rate rk. The problem is to find a control policy in order to accept/reject the arriving objects as a function of the current state in order to maximize the average revenue. Optimization is carried out over the class of coordinate convex policies. Among other results, for the general case of K classes, the authors consider the problem of finding the optimal static control, where for each class a portion of the knapsack is dedicated.

    Original languageEnglish (US)
    Title of host publicationProceedings of the IEEE Conference on Decision and Control
    PublisherPubl by IEEE
    Pages632-633
    Number of pages2
    StatePublished - Dec 1988
    EventProceedings of the 27th IEEE Conference on Decision and Control - Austin, TX, USA
    Duration: Dec 7 1988Dec 9 1988

    Other

    OtherProceedings of the 27th IEEE Conference on Decision and Control
    CityAustin, TX, USA
    Period12/7/8812/9/88

    ASJC Scopus subject areas

    • Chemical Health and Safety
    • Control and Systems Engineering
    • Safety, Risk, Reliability and Quality

    Cite this