Paper Type |
Contributed Paper |
Title |
The optimal value bounds of the objective function in theinterval linear programming problem |
Author |
M. Allahdadi, H. Mishmast Nehi |
Email |
hmnehi@hamoon.usb.ac.ir; m_allahdadi@math.usb.ac.ir |
Abstract: In this paper we deal with solving Interval Linear Programming (ILP) problems. The aim of solving ILP problems is finding the best and the worst optimum values for objective function. We consider ILP problems with equality and inequality constraints and we illustrate weakness of the Tong-Shaocheng method for finding the worst value of the objective function when there is at least an equality constraint. |
|
Start & End Page |
501 - 511 |
Received Date |
2012-04-07 |
Revised Date |
|
Accepted Date |
2013-05-29 |
Full Text |
Download |
Keyword |
: Interval linear programming, interval coefficient, interval systems |
Volume |
Vol.42 No.2 (APRIL 2015) |
DOI |
|
Citation |
Allahdadi M. and Nehi H.M., The optimal value bounds of the objective function in theinterval linear programming problem, Chiang Mai J. Sci., 2015; 42(2): 501-511. |
SDGs |
|
View:530 Download:196 |