The optimal value bounds of the objective function in theinterval linear programming problem
M. Allahdadi, H. Mishmast Nehi* Author for corresponding; e-mail address: hmnehi@hamoon.usb.ac.ir; m_allahdadi@math.usb.ac.ir
Volume: Vol.42 No.2 (APRIL 2015)
Research Article
DOI:
Received: 7 April 2012, Revised: -, Accepted: 29 May 2013, Published: -
Citation: Allahdadi M. and Nehi H.M., The optimal value bounds of the objective function in theinterval linear programming problem, Chiang Mai Journal of Science, 2015; 42(2): 501-511.
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.