Skip to main content
SpringerLink
Log in

The optimal solution set of the interval linear programming problems

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Several methods exist for solving the interval linear programming (ILP) problem. In most of these methods, we can only obtain the optimal value of the objective function of the ILP problem. In this paper we determine the optimal solution set of the ILP as the intersection of some regions, by the best and the worst case (BWC) methods, when the feasible solution components of the best problem are positive. First, we convert the ILP problem to the convex combination problem by coefficients 0 ≤ λ j , μ ij , μ i  ≤ 1, for i = 1, 2, . . . , m and j = 1, 2, . . . , n. If for each i, j, μ ij  = μ i  = λ j  = 0, then the best problem has been obtained (in case of minimization problem). We move from the best problem towards the worst problem by tiny variations of λ j , μ ij and μ i from 0 to 1. Then we solve each of the obtained problems. All of the optimal solutions form a region that we call the optimal solution set of the ILP. Our aim is to determine this optimal solution set by the best and the worst problem constraints. We show that some theorems to validity of this optimal solution set.

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. Alefeld G., Herzberger J.: Introduction to interval computations. Academic Press, Orlando, FL (1983)

    MATH  Google Scholar 

  2. Chinneck JW., Ramadan K.: Linear programming with interval coefficient. J. Oper. Res. Soc. 51, 209–220 (2002)

    Google Scholar 

  3. Fiedler M., Nedoma J., Ramik J., Zimmermann K.: Linear optimization problems with inexact data. Springer, Berlin (2003)

    Google Scholar 

  4. Hansen E., Walster G.W.: Global optimization using interval analysis, second edition, revised and expanded. Marcel Dekker, New York (2004)

    Google Scholar 

  5. Hladik M.: How to determine basis stability in interval linear programming. Technical report KAM-DIMATIA Series (2010-973), Department of Applied Mathematics, Charles University, Prague (2010)

  6. Hladik M.: Interval linear programming: A survey. In: Mann, Z.A. (ed.) Linear Programming–New Frontiers in Theory and Applications., Nova Science publishers, New York (2011)

    Google Scholar 

  7. Konickova J.: Sufficient condition of basis stability of an interval linear programming problem. ZAMM, Z. Angew. Math. Mech. 81(Suppl.3), 677–678 (2001)

    Article  MATH  Google Scholar 

  8. Rex J., Rohn J.: sufficient conditions for regularity and singularity of interval matrices. SIAM J. Matrix Anal. Appl. 20(2), 437–445 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Rohn J.: Cheap and tight bound: The recent result by E. Hansen can be made more efficient. Interval comput. 1993(4), 13–21 (1993)

    MathSciNet  MATH  Google Scholar 

  10. Shaocheng T.: Interval number and fuzzy number linear programming. Fuzzy Sets Syst. 66, 301–306 (1994)

    Article  Google Scholar 

  11. Stewart N.F.: Interval arithmetic for guaranteed bounds in linear programming. J. Optim. Theory Appl. 12, 1–5 (1973)

    Article  MATH  Google Scholar 

  12. Zhou F., Huang G.H., Chen G., Guo H.: Enhanced-interval linear programming. Eur. J. Oper. Res. 199, 323–333 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Faculty, University of Sistan and Baluchestan, Zahedan, Iran

    M. Allahdadi & H. Mishmast Nehi

Authors
  1. M. Allahdadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Mishmast Nehi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to H. Mishmast Nehi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Allahdadi, M., Mishmast Nehi, H. The optimal solution set of the interval linear programming problems. Optim Lett 7, 1893–1911 (2013). https://doi.org/10.1007/s11590-012-0530-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-012-0530-4

Keywords

Search

Navigation