Linear programming with interval variables is the development of linear programming with interval coefficients. In this paper, linear programming with interval variables is solved using the interior point method based on interval boundary calculations. The solution’s initial procedure is to change the linear programming model with interval variables into a pair of classical linear programming models. This pair of two classical linear programming models corresponds to an interval boundary called the least upper bound and the greatest lower bound. The least upper bound is determined using the largest feasible region and the greatest lower bound is determined by using the smallest feasible region. The least upper bound and the greatest lower bound are obtained using the interior point method. Finally, the optimal solution in the form of intervals is obtained by constructing the two models. This paper provides an alternative solution to solve the linear interval programming problem by using the interior point method.

interval linear programming, interval variables, interior point method.

Received: December 28, 2020; Accepted: January 11, 2021; Published: March 19, 2021

How to cite this article: Agustina Pradjaningsih, Fatmawati and Herry Suprajitno, A solution of linear programming with interval variables using the interior point method based on interval boundary calculations, Far East Journal of Applied Mathematics 109(2) (2021), 103-119. DOI: 10.17654/AM109020103

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:

[1] G. Alefeld and J. Herzberger, Introduction to Interval Computation, Academic Press, New York, 1983.
[2] I. Alolyan, Algorithm for interval linear programming involving interval constraints, Proceedings of the World Congress on Engineering and Computer Science I, 2013.
[3] J. W. Chinnek and K. Ramadhan, Linear programming with interval coefficients, Journal of the Operational Research Society 51(2) (2000), 209-220.
[4] E. K. P. Chong and H. Z. Stanislaw, An Introduction to Optimization, 2nd ed., John Wiley & Sons, Inc., New York, 2001.
[5] Y. R. Fan and G. H. Huang, A robust two-step method for solving interval linear programming problems within an environmental management context, Journal of Environmental Informatics 19(1) (2012), 1-9.
[6] J. Gondzio, Interior point methods 25 years later, European Journal of Operational Research 218(3) (2012), 587-601.
[7] D. D. Hertog, Interior point approach to linear, quadratic and convex programming, Springer Science + Business Media, BV, 1994.
[8] F. S. Hillier and G. J. Lieberman, Introduction to Operation Research, 10th ed., McGraw-Hill Higher Education, 2014.
[9] G. H. Huang, B. W. Baetz and G. G. Patry, A grey linear programming approach for municipal solid waste management planning under uncertainty, Civil Engineering Systems 9-4 (1992), 319-335.
[10] N. Karmakar, A new polynomial time algorithm for linear programming, Combinatorica 4(4) (1984), 373-395.
[11] J. E. Mitchell, K. Farwell and D. Ramsden, Interior point methods for large-scale linear programming, M. G. C. Resende and P. M. Pardalos, eds., Handbook of Optimization in Telecommunications, 2006, pp. 3-25.
[12] A. A. Molai and E. Khorram, Linear programming problem with interval coefficients and interpretation for its constraint, Iranian Journal of Science and Technology, Transaction A 31(A4) (2007), 369-390.
[13] R. E. Moore, Interval Analysis, Prentice-Hall, 1966.
[14] A. Pradjaningsih, Fatmawati and H. Suprajitno, Interior point method for solving linear programming with interval coefficients using affine scaling, Far East J. Math. Sci. (FJMS) 111(2) (2019), 195-211.
[15] G. Ramesh and K. Ganesan, Interval linear programming with generalized interval arithmetic, International Journal of Scientific and Engineering Research 2(11) (2011), 1-8.
[16] G. Ramesh and K. Ganesan, Duality theory for interval linear programming, IOSR Journal of Mathematics (IOSRJM) 4(4) (2012), 39-47.
[17] H. Suprajitno and I. bin Mohd, Interval linear programming, Proceedings of the 3 International Conference on Mathematics and Statistics (ICOMS-3), Institut Pertanian Bogor, Indonesia, 2008.
[18] H. Suprajitno, I. bin Mohd, M. Mamat and F. Ismail, Linear programming with interval variables, Proceedings of ICORAFSS 2009, Malaysia, 2-4 June 2009.
[19] H. Suprajitno and I. bin Mohd, Linear programming with interval arithmetic, Int. J. Contemp. Math. Sci. 5 (2010), 323-332.
[20] Y. Zhong, Y. Jia, D. Chen and Y. Yang, Interior point method for solving fuzzy number linear programming using linear ranking function, Handbook of Optimization in Telecommunications, 2013, pp. 3-25.
[21] F. Zhou, G. H. Huang, G. Chen and H. Guo, Enhanced-interval linear programming, European J. Oper. Res. 199-2 (2009), 323-333.