On the linear programming problems with interval coefficients

Brown–Robinson method for interval matrix games

“…There are different approaches to the comparison of fuzzy numbers and interval numbers proposed in the literature; see Ishibuchi and Tanaka (1990), Okada and Gen (1994), Nakahara et al (1992), Kundu (1997). In this paper, we use the acceptability index idea suggested by Sengupta et al (2001) and Sengupta and Pal (2009).…”

A Decomposable Computer Oriented Method for Solving Interval LP Problems

“…Radimir Viher [18] develop an analogous theorem to solve ILP problems. Nakahara Sasaki and Gen [19] investigate a LP problem with interval coefficients and proposed a new concept of constraints based on probability. None of the above papers addressed the decomposition of ILP problems.…”

Duality Theory for Interval Linear Programming Problems

“…Linear programming problems with interval coefficients have been studied by several authors, such as Atanu Sengupta et al [2,3], Bitran [5], Chanas and Kuchta [6], Nakahara et al [20], Steuer [26] and Tong Shaocheng [31]. Numerous methods for comparison of interval numbers can be found as in Atanu Sengupta and Tapan Kumar Pal [2,3], Ganesan and Veeramani [8,9] etc.…”