Skip to main content
SpringerLink
Log in

Knapsack with variable weights satisfying linear constraints

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

We introduce a variant of the knapsack problem, in which the weights of items are also variables but must satisfy a system of linear constraints, and the capacity of knapsack is given and known. We discuss two models: (1) the value of each item is given; (2) the value-to-weight ratio of each item is given. The goal is to determine the weight of each item, and to find a subset of items such that the total weight is no more than the capacity and the total value is maximized. We provide several practical application scenarios that motivate our study, and then investigate the computational complexity and corresponding algorithms. In particular, we show that if the number of constraints is a fixed constant, then both problems can be solved in polynomial time. If the number of constraints is an input, then we show that the first problem is NP-Hard and cannot be approximated within any constant factor unless \(\mathrm{P}= \mathrm{NP}\), while the second problem is NP-Hard but admits a polynomial time approximation scheme. We further propose approximation algorithms for both problems, and extend the results to multiple knapsack cases with a fixed number of knapsacks and identical capacities.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adams, W.P., Sherali, H.D.: Mixed-integer bilinear programming problems. Math. Program. 59(1), 279–305 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35–53 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bhalgat, A., Goel, A., Khanna, S.: Improved approximation results for stochastic knapsack problems. In: Proceedings of the Twenty-second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’11, pp. 1647–1665. SIAM (2011)

  4. Burer, S., Letchford, A.N.: Non-convex mixed-integer nonlinear programming: A survey. Surv. Oper. Res. Manag. Sci. 17(2), 97–106 (2012)

    MathSciNet  Google Scholar 

  5. Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713–728 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dean, B.C.: Approximation algorithms for stochastic scheduling problems. Ph.D. thesis, Massachusetts Institute of Technology, Boston (2005)

  7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco (1979)

    MATH  Google Scholar 

  8. Gupte, A., Ahmed, S., Cheon, M., Dey, S.: Solving mixed integer bilinear problems using MILP formulations. SIAM J. Optim. 23(2), 721–744 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  9. Håstad, J.: Clique is hard to approximate within \(n^{1 - \epsilon }\). In: Proceedings 37th Annual Symposium on Foundations of Computer Science, pp. 627–636 (1996)

  10. Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22(4), 463–468 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, New York (2004)

    Book  MATH  Google Scholar 

  12. Köppe, M.: On the complexity of nonlinear mixed-integer optimization. In: Lee, J., Leyffer, S. (eds.) Mixed-Integer Nonlinear Programming. IMA Volumes in Mathematics and its Applications, vol. 154, pp. 533–558. Springer, Berlin (2011)

    Chapter  Google Scholar 

  13. Monaci, M., Pferschy, U.: On the robust knapsack problem. SIAM J. Optim. 23(4), 1956–1982 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  14. Nip, K., Wang, Z., Wang, Z.: Scheduling under linear constraints. Eur. J. Oper. Res. 253(2), 290–297 (2016)

    Article  MATH  MathSciNet  Google Scholar 

  15. Sahni, S.: Algorithms for scheduling independent tasks. J. ACM 23(1), 116–127 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  16. Wang, Z., Xing, W.: A successive approximation algorithm for the multiple knapsack problem. J. Comb. Optim. 17(4), 347–366 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  17. Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)

    Book  MATH  Google Scholar 

  18. Ye, Y.: Interior Point Algorithms: Theory and Analysis. Wiley-Interscience, New York (1997)

    Book  MATH  Google Scholar 

Download references

Acknowledgements

We thank the anonymous reviewers for their constructive comments. Zhenbo Wang’s research has been supported by NSFC No. 11371216.

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Tsinghua University, Beijing, China

    Kameng Nip & Zhenbo Wang

  2. Department of Industrial and Systems Engineering, University of Minnesota, Minneapolis, MN, USA

    Zizhuo Wang

Authors
  1. Kameng Nip
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhenbo Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zizhuo Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhenbo Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nip, K., Wang, Z. & Wang, Z. Knapsack with variable weights satisfying linear constraints. J Glob Optim 69, 713–725 (2017). https://doi.org/10.1007/s10898-017-0540-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-017-0540-y

Keywords

Search

Navigation