Skip to main content
SpringerLink
Log in

One approach to solving a discrete production planning problem with interval data

  • Mathematical Programming
  • Published:
Proceedings of the Steklov Institute of Mathematics Aims and scope Submit manuscript

Abstract

In this paper, we develop an approach to solving integer programming problems with interval data based on using the possibilities of varying the relaxation set of the problem. This is illustrated by means of an L-class enumeration algorithm for solving a dicrete production planning problem. We describe the algorithm and a number of its modifications and present results of a computational experiment for families of problems from the OR Library and with randomly generated initial data. This approach is also applied to obtain approximate solutions of the mentioned problem in its conventional setting.

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. M. R. Garey and D. S. Johnson, Computers and Intractability (Freeman, New York, 1979; Mir, Moscow, 1982).

    MATH  Google Scholar 

  2. M. V. Devyaterikova, A. A. Kolokolov, and A. P. Kolosov, in Discrete Optimization and Operations Research (IM SO RAN, Novosibirsk, 2007), p. 124 [in Russian].

    Google Scholar 

  3. A. A. Kolokolov, Sibirsk. Zh. Issled. Oper. 1(2), 18 (1994).

    MathSciNet  Google Scholar 

  4. A. A. Kolokolov and M. V. Devyaterikova, L-Class Enumeration Algorithms for the Knapsack Problem with Interval Data (Izd. Omsk. Gos. Univ., Omsk, 2001) [in Russian].

    Google Scholar 

  5. A. A. Kolokolov and A. P. Kolosov, in Information Bulletin of the Mathematical Programming Association (UrO RAN, Yekaterinburg, 2007), No. 11, p. 186 [in Russian].

    Google Scholar 

  6. I. V. Sergienko, L. N. Kozeratskaya, and T. T. Lebedeva, Stability and Parametric Analysis of Discrete Optimization Problems (Naukova Dumka, Kiev, 1995) [in Russian].

    Google Scholar 

  7. Y. Akcay and S. H. Xu, Management Science 50, 99 (2004).

    Article  Google Scholar 

  8. M. V. Devyaterikova and A. A. Kolokolov, in Proc. 12th IFAC Symposium on Information Control Problems in Manufacturing (Elsevier Science, 2006), Vol. 3, pp. 9–13.

    Google Scholar 

  9. P. Kouvelis and G. Yu, Robust Discrete Optimization and Its Applications (Kluwer, Dordrecht, 1997).

    MATH  Google Scholar 

  10. E. Y.-H. Lin, INFOR 36(4), 274 (1998).

    Google Scholar 

  11. L. L. Lu, S. Y. Chiu, and L. A. Cox, Operations Research 50, 645 (1999).

    Article  MATH  Google Scholar 

  12. A. Mahjoub, J. Miheliǧ, C. Rapine, and B. Robiǧ, in Discrete Optimization Methods in Production and Logistics (Nasledie Dialog-Sibir’, Omsk, 2004), pp. 75–80.

    Google Scholar 

  13. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations (New York, Wiley, 1990).

    MATH  Google Scholar 

  14. http://people.brunel.ac.uk/:_mastjjb/jeb/orlib/mknapinfo.html.

Download references

Author information

Authors and Affiliations

  1. Omsk Branch of the Sobolev Institute of Mathematics, Siberian Division of the Russian Academy of Sciences, ul. Pevtsova 13, Omsk, 644099, Russia

    M. V. Devyaterikova, A. A. Kolokolov & A. P. Kolosov

Authors
  1. M. V. Devyaterikova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. Kolokolov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. P. Kolosov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © M.V. Devyaterikova, A.A. Kolosov, A.P. Kolosov, 2008, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2008, Vol. 14, No. 2.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Devyaterikova, M.V., Kolokolov, A.A. & Kolosov, A.P. One approach to solving a discrete production planning problem with interval data. Proc. Steklov Inst. Math. 263 (Suppl 2), 37–46 (2008). https://doi.org/10.1134/S0081543808060059

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0081543808060059

Keywords

Search

Navigation