Volume 14, Issue 2 (7-2017)                   2017, 14(2): 111-121 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Allahdadi M, Mishmast Nehi H. New Solution Space for Solving the Interval Linear Programming Model. Journal of Operational Research and Its Applications. 2017; 14 (2) :111-121
URL: http://jamlu.liau.ac.ir/article-1-1095-en.html
Department of Mathematics, University of Sistan and Baluchestan, Zahedan
Abstract:   (3271 Views)
We consider interval linear programming (ILP) problems in the current paper. Best-worst case (BWC) is one of the methods for solving ILP models. BWC determines the values ​​of the target function, but some of the solutions obtained through BWC may result in an infeasible space. To guarantee that solution is completely feasible (i.e. avoid constraints violation), improved two-step method (ITSM) has been proposed. Many solutions are lost in this method. By using an algorithm, we introduce closed ball method (namely, CBM) as a new method for solving ILP models. In this method, feasibility test ensures that solution space is feasible. To demonstrate the effectiveness of the proposed approach, we solve two numeric examples and we compare the results obtained through BWC, ITSM, and CBM.
Full-Text [PDF 637 kb]   (1327 Downloads)    
Type of Study: Research | Subject: Special
Received: 2016/12/16 | Accepted: 2017/05/5 | Published: 2017/08/21

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.