NEW SOLUTION SPACE FOR SOLVING THE INTERVAL LINEAR PROGRAMMING MODEL

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

ALLAHDADI M.; MISHMAST NEHI H.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Operational Research in its Applications Year:2017 | Volume:14 | Issue:2 (53) Page(s): 111-121

Download Full-Text

Persian Verion

View:

1,152

Download:

Cites:

Information Journal Paper

Title

NEW SOLUTION SPACE FOR SOLVING THE INTERVAL LINEAR PROGRAMMING MODEL

Author(s)

ALLAHDADI M. | MISHMAST NEHI H. | Issue Writer Certificate

Keywords

INTERVAL LINEAR PROGRAMMINGQ2

BWCQ1

ITSMQ1

UNCERTAINTYQ1

Abstract

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 twostep 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.

Cites

No record.

References

No record.

Cite

APA: Copy

ALLAHDADI, M., & MISHMAST NEHI, H.. (2017). NEW SOLUTION SPACE FOR SOLVING THE INTERVAL LINEAR PROGRAMMING MODEL. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), 14(2 (53) ), 111-121. SID. https://sid.ir/paper/164697/en

Vancouver: Copy

ALLAHDADI M., MISHMAST NEHI H.. NEW SOLUTION SPACE FOR SOLVING THE INTERVAL LINEAR PROGRAMMING MODEL. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)[Internet]. 2017;14(2 (53) ):111-121. Available from: https://sid.ir/paper/164697/en

IEEE: Copy

M. ALLAHDADI, and H. MISHMAST NEHI, “NEW SOLUTION SPACE FOR SOLVING THE INTERVAL LINEAR PROGRAMMING MODEL,” JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), vol. 14, no. 2 (53) , pp. 111–121, 2017, [Online]. Available: https://sid.ir/paper/164697/en

Related Journal Papers