An Improved Three-Step Method for Solving the Interval Linear Programming Problems
Yugoslav journal of operations research, Tome 28 (2018) no. 4.

Voir la notice de l'article dans eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Feasibility condition, which ensures that the solution space does not violate any constraints, and optimality condition, which guarantees that all points of the solution space are optimal, are very significant conditions for the solution space of interval linear programming (ILP) problems. Among the existing methods for ILP problems, the best-worst cases (BWC) method and two-step method (TSM) do not ensure feasibility condition, while the modified ILP (MILP), robust TSM (RTSM), improved TSM (ITSM), and three-step method (ThSM) guarantee feasibility condition, whose solution spaces may not be completely optimal. We propose an improved ThSM (IThSM) for ILP problems, which ensures both feasibility and optimality conditions, i.e., we introduce an extra step to optimality.
Mots-clés : Feasibility, Interval Linear Programming, Optimality, Robust two-step Method, Three-step Method 
@article{YJOR_2018_28_4_a0,
     author = {Mehdi Allahdadi and Chongyang Deng},
     title = {An {Improved} {Three-Step} {Method} for {Solving} the {Interval} {Linear} {Programming} {Problems}},
     journal = {Yugoslav journal of operations research},
     pages = {435 - 451},
     publisher = {mathdoc},
     volume = {28},
     number = {4},
     year = {2018},
     url = {https://geodesic-test.mathdoc.fr/item/YJOR_2018_28_4_a0/}
}
TY  - JOUR
AU  - Mehdi Allahdadi
AU  - Chongyang Deng
TI  - An Improved Three-Step Method for Solving the Interval Linear Programming Problems
JO  - Yugoslav journal of operations research
PY  - 2018
SP  - 435 
EP  -  451
VL  - 28
IS  - 4
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/YJOR_2018_28_4_a0/
ID  - YJOR_2018_28_4_a0
ER  - 
%0 Journal Article
%A Mehdi Allahdadi
%A Chongyang Deng
%T An Improved Three-Step Method for Solving the Interval Linear Programming Problems
%J Yugoslav journal of operations research
%D 2018
%P 435 - 451
%V 28
%N 4
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/YJOR_2018_28_4_a0/
%F YJOR_2018_28_4_a0
Mehdi Allahdadi; Chongyang Deng. An Improved Three-Step Method for Solving the Interval Linear Programming Problems. Yugoslav journal of operations research, Tome 28 (2018) no. 4. https://geodesic-test.mathdoc.fr/item/YJOR_2018_28_4_a0/