IDEAS home Printed from https://ideas.repec.org/a/spr/etbull/v10y2022i1d10.1007_s40505-022-00217-3.html
   My bibliography  Save this article

The fractional multidimensional knapsack problem: solution and uniqueness

Author

Listed:
  • John Y. Zhu

    (University of Kansas)

Abstract

Every solution to the fractional multidimensional knapsack problem admits a cost–benefit interpretation: for each solution, it is possible to associate a price to each dimension such that an object is placed (not placed) in the knapsack if its cost under the associated price system is strictly less (greater) than its benefit. In particular, an object is fractionally placed in the knapsack only if its cost equals its benefit. The characterization is sharper than what is implied by strong duality. Practical conditions are then provided that guarantee the solution is unique. The results yield a simple criterion for when an incremental addition to the collection of objects placeable in the knapsack is worthwhile.

Suggested Citation

  • John Y. Zhu, 2022. "The fractional multidimensional knapsack problem: solution and uniqueness," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 10(1), pages 95-103, May.
    • Handle: RePEc:spr:etbull:v:10:y:2022:i:1:d:10.1007_s40505-022-00217-3
    DOI: 10.1007/s40505-022-00217-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s40505-022-00217-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s40505-022-00217-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sven de Vries & Rakesh V. Vohra, 2003. "Combinatorial Auctions: A Survey," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 284-309, August.
    2. Hai Nguyen & Thành Nguyen & Alexander Teytelboym, 2021. "Stability in Matching Markets with Complex Constraints," Management Science, INFORMS, vol. 67(12), pages 7438-7454, December.
    3. Mansini, Renata & Speranza, Maria Grazia, 1999. "Heuristic algorithms for the portfolio selection problem with minimum transaction lots," European Journal of Operational Research, Elsevier, vol. 114(2), pages 219-233, April.
    4. Jayaraman, Vaidyanathan & Pirkul, Hasan, 2001. "Planning and coordination of production and distribution facilities for multiple commodities," European Journal of Operational Research, Elsevier, vol. 133(2), pages 394-408, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
    2. Gansterer, Margaretha & Hartl, Richard F. & Sörensen, Kenneth, 2020. "Pushing frontiers in auction-based transport collaborations," Omega, Elsevier, vol. 94(C).
    3. Liu, Yong-Jun & Zhang, Wei-Guo, 2015. "A multi-period fuzzy portfolio optimization model with minimum transaction lots," European Journal of Operational Research, Elsevier, vol. 242(3), pages 933-941.
    4. Ngoc Mai Tran & Josephine Yu, 2015. "Product-Mix Auctions and Tropical Geometry," Papers 1505.05737, arXiv.org, revised Oct 2017.
    5. Hrabec, Dušan & Hvattum, Lars Magnus & Hoff, Arild, 2022. "The value of integrated planning for production, inventory, and routing decisions: A systematic review and meta-analysis," International Journal of Production Economics, Elsevier, vol. 248(C).
    6. Saurabh Amin & Patrick Jaillet & Haripriya Pulyassary & Manxi Wu, 2023. "Market Design for Capacity Sharing in Networks," Papers 2307.03994, arXiv.org, revised Nov 2024.
    7. Bourbeau, Benoit & Gabriel Crainic, Teodor & Gendreau, Michel & Robert, Jacques, 2005. "Design for optimized multi-lateral multi-commodity markets," European Journal of Operational Research, Elsevier, vol. 163(2), pages 503-529, June.
    8. Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2015. "Linear vs. quadratic portfolio selection models with hard real-world constraints," Computational Management Science, Springer, vol. 12(3), pages 345-370, July.
    9. Tobias Buer & Rasmus Haass, 2018. "Cooperative liner shipping network design by means of a combinatorial auction," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 686-711, December.
    10. Oktay Günlük & Lászlo Ladányi & Sven de Vries, 2005. "A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions," Management Science, INFORMS, vol. 51(3), pages 391-406, March.
    11. M A Krajewska & H Kopfer & G Laporte & S Ropke & G Zaccour, 2008. "Horizontal cooperation among freight carriers: request allocation and profit sharing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1483-1491, November.
    12. Buckley, Winston & Long, Hongwei & Marshall, Mario, 2016. "Numerical approximations of optimal portfolios in mispriced asymmetric Lévy markets," European Journal of Operational Research, Elsevier, vol. 252(2), pages 676-686.
    13. Faranak Emtehani & Nasim Nahavandi & Farimah Mokhatab Rafiei, 2021. "A joint inventory–finance model for coordinating a capital-constrained supply chain with financing limitations," Financial Innovation, Springer;Southwestern University of Finance and Economics, vol. 7(1), pages 1-39, December.
    14. Talebiyan, Hesam & Dueñas-Osorio, Leonardo, 2023. "Auctions for resource allocation and decentralized restoration of interdependent networks," Reliability Engineering and System Safety, Elsevier, vol. 237(C).
    15. Ervasti, Valtteri & Leskelä, Riikka-Leena, 2010. "Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support," European Journal of Operational Research, Elsevier, vol. 203(1), pages 251-260, May.
    16. Shiva Moslemi & Mohammad Hossein Zavvar Sabegh & Abolfazl Mirzazadeh & Yucel Ozturkoglu & Eric Maass, 2017. "A multi-objective model for multi-production and multi-echelon closed-loop pharmaceutical supply chain considering quality concepts: NSGAII approach," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(2), pages 1717-1733, November.
    17. Halit Üster & Gopalakrishnan Easwaran & Elif Akçali & Sila Çetinkaya, 2007. "Benders decomposition with alternative multiple cuts for a multi‐product closed‐loop supply chain network design model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(8), pages 890-907, December.
    18. Richard Li-Yang Chen & Shervin AhmadBeygi & Amy Cohn & Damian R. Beil & Amitabh Sinha, 2009. "Solving Truckload Procurement Auctions Over an Exponential Number of Bundles," Transportation Science, INFORMS, vol. 43(4), pages 493-510, November.
    19. Song, Jiongjiong & Regan, Amelia, 2005. "Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts," Transportation Research Part B: Methodological, Elsevier, vol. 39(10), pages 914-933, December.
    20. Zhang, Cheng & Gong, Xiaomin & Zhang, Jingshu & Chen, Zhiwei, 2023. "Dynamic portfolio allocation for financial markets: A perspective of competitive-cum-compensatory strategy," Journal of International Financial Markets, Institutions and Money, Elsevier, vol. 84(C).

    More about this item

    Keywords

    Multidimensional knapsack; Linear programming; Optimization; Production; Resource allocation;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • D24 - Microeconomics - - Production and Organizations - - - Production; Cost; Capital; Capital, Total Factor, and Multifactor Productivity; Capacity
    • H40 - Public Economics - - Publicly Provided Goods - - - General

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:etbull:v:10:y:2022:i:1:d:10.1007_s40505-022-00217-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.