Proceedings of the International Conference on Mathematics, Geometry, Statistics, and Computation (IC-MaGeStiC 2021)

<Previous Article In Volume
Next Article In Volume>

Modification Interior-Point Method for Solving Interval Linear Programming

Authors
Agustina Pradjaningsih1, *, Fatmawati2, Herry Suprajitno2
1Department of Mathematics, Faculty of Mathematics and Science, Jember University
2Department of Mathematics, Faculty of Science and Technology, Universitas Airlangga
*Corresponding author. Email: agustina.fmipa@unej.ac.id
Corresponding Author
Agustina Pradjaningsih
Available Online 8 February 2022.
DOI
10.2991/acsr.k.220202.019How to use a DOI?
Keywords
Interval Linear Programming; Interior Point Method; Interval Arithmetic
Abstract

Linear programming is mathematical programming developed to deal with optimization problems involving linear equations in the objective and constraint functions. One of the basic assumptions in linear programming problems is the certainty assumption. Assumption of certainty shows that all coefficients variable or decision variables in the model are constants that are known with certainty. However, in real situations or problems, there may be uncertain coefficients or decision variables. Based on the concept and theory of interval analysis, this uncertainty problem is anticipated by making approximate values in intervals to develop linear interval programming. The development of interval linear programming starts from linear programming with interval-shaped coefficients, both in the coefficient of the objective function and the coefficient of the constraint function. It was subsequently developed into linear programming with coefficients and decision variables in intervals, commonly known as interval linear programming. Until now, the completion of interval linear programming is based on the calculation of the interval limit. The initial procedure for the solution is to change the linear programming model with interval variables into two classical linear programming models. Finally, the optimal solution in the form of intervals is obtained by constructing two models. This paper provides an alternative solution to directly solve the linear interval programming problem without building it into two models. The solution is done using the interval arithmetic approach, while the method used is the modified interior-point method.

Copyright
© 2022 The Authors. Published by Atlantis Press International B.V.
Open Access
This is an open access article under the CC BY-NC license.

Download article (PDF)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the International Conference on Mathematics, Geometry, Statistics, and Computation (IC-MaGeStiC 2021)
Series
Advances in Computer Science Research
Publication Date
8 February 2022
ISBN
10.2991/acsr.k.220202.019
ISSN
2352-538X
DOI
10.2991/acsr.k.220202.019How to use a DOI?
Copyright
© 2022 The Authors. Published by Atlantis Press International B.V.
Open Access
This is an open access article under the CC BY-NC license.

Cite this article

risenwbib
TY  - CONF
AU  - Agustina Pradjaningsih
AU  - Fatmawati
AU  - Herry Suprajitno
PY  - 2022
DA  - 2022/02/08
TI  - Modification Interior-Point Method for Solving Interval Linear Programming
BT  - Proceedings of the  International Conference on Mathematics, Geometry, Statistics, and Computation (IC-MaGeStiC 2021)
PB  - Atlantis Press
SP  - 92
EP  - 97
SN  - 2352-538X
UR  - https://doi.org/10.2991/acsr.k.220202.019
DO  - 10.2991/acsr.k.220202.019
ID  - Pradjaningsih2022
ER  -