Skip to main content
Log in

Checking weak optimality of the solution to interval linear program in the general form

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

Abstract

One of the basic and difficult tasks in interval linear programming (IvLP) problems is to check whether a given point is weak optimal. In this paper, we investigate IvLP problem in the general form, in which the constraints contain mixed interval linear equations and inequalities with both non-negative and free variables. Necessary and sufficient conditions for checking weak optimality of a given vector are established, based on the KKT conditions of linear programming and the newly established weak solvability characterizations of mixed interval linear systems by Hladík. The result solves one of the open problems proposed by Hladík (Linear Programming New Frontiers. Nova Science Publishers, Inc 2012).

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Chinneck, J.W., Ramadan, K.: Linear programming with interval coefficients. J. Oper. Res. Soc. 51(2), 209–220 (2000)

    Article  MATH  Google Scholar 

  2. Fiedler, M., Nedoma, J., Ramik, J., Rohn, J., Zimmermann, K.: Linear Optimization Problems Within Exact Data. Springer, New York (2006)

    Google Scholar 

  3. Hladík, M.: Optimal value range in interval linear programming. Fuzzy Optim. Decis. Mak. 8(3), 283–294 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hladík, M.: Interval linear programming: a survey. In: Mann, Z.A. (ed.) Linear Programming New Frontiers, pp. 1–46. Nova Science Publishers Inc., New York (2012)

  5. Li, W., Tian, X.: Fault detection in discrete dynamic systems with uncertainty based on interval optimization. Math. Model. Anal. 16(4), 549–557 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Li, W., Luo, J., Deng, C.: Necessary and sufficient conditions of some strong optimal solutions to the interval linear programming. Linear Algebra Appl. 439, 3241–3255 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hladík, M.: On approximation of the best case optimal value in interval linear programming. Optim. Lett. (2014). doi:10.1007/s11590-013-0715-5

    Google Scholar 

  8. Steuer, R.E.: Algorithms for linear programming problems with interval objective function coefficients. Math. Oper. Res. 6, 333–348 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ishibuchi, H., Tanaka, H.: Multiobjective programming in optimization of the interval objective function. Eur. J. Oper. Res. 48, 219–225 (1990)

    Article  MATH  Google Scholar 

  10. Li, W., Wang, G.: General solutions for linear programming with interval right hand side. Proc. ICMLC 3, 1836–1839 (2006). (in Xizhao Wang, Daniel Yeung and Xiaolong Wang eds. Dalian.)

    Google Scholar 

  11. Gabrel, V., Murat, C., Remli, N.: Linear programming with interval right hand sides. Int. Trans. Oper. Res. 17(3), 397–408 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  12. Allahdadi, M., Nehi, H.M.: The optimal solution set of the interval linear programming problems. Optim. Lett. 7(8), 1893–1911 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hladík, M.: How to determine basis stability in interval linear programming. Optim. Lett. 8(1), 375–389 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  14. Li, W., Luo, J., Wang, Q., Li, Y.: Checking weak optimality of the solution to linear programming with interval right-hand side. Optim. Lett. 8(4), 1287–1299 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  15. Hladík, M.: Weak and strong solvability of interval linear systems of equations and inequalities. Linear Algebra Appl. 438, 4156–4165 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  16. Li, W., Liu, X., Li, H.: Generalized solutions to interval linear programmes and related necessary and sufficient optimality conditions. Optim. Methods Softw. (2014). doi:10.1080/10556788.2014.940948

  17. Li, H., Luo, J., Wang, Q.: Solvability and feasibility of interval linear equations and inequalities. Linear Algebra Appl. 463, 78–94 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  18. Prokopyev, Oleg A., Butenko, Sergiy, Trapp, Andrew C.: Checking solvability of systems of interval linear equations and inequalities via mixed integer programming. Eur. J. Oper. Res. 199(1), 117–121 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  19. Rohn, J.: A Farkas-type theorem for interval linear inequalities. Optim. Lett. 8(4), 1591–1598 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  20. Xia, M., Li, W., Li, H.,: Farkas-type theorems for interval linear systems. Linear Multilinear Algebra (2014). doi:10.1080/03081087.2014.940827

Download references

Acknowledgments

We are grateful to an anonymous referee for his/her valuable suggestions which led to improvements in the current version. The remarks at the ends of Sects. 3 and 4 are base on his/her suggestions. We are also grateful to the editor for his/her valuable comments, which have helped us to improve the quality of the article. The authors were partially supported by the NSF of Zhejiang Province (Grant No. LY14A010028) and NNSF of China (Grant No. 11171316).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Haohao Li.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, W., Liu, P. & Li, H. Checking weak optimality of the solution to interval linear program in the general form. Optim Lett 10, 77–88 (2016). https://doi.org/10.1007/s11590-015-0856-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-015-0856-9

Keywords

Navigation