Abstract: | A pseudo-monotonic interval program is a problem of maximizing f(x) subject to x ε X = {x ε Rn | a < Ax < b, a, b ε Rm} where f is a pseudomonotonic function on X, the set defined by the linear interval constraints. In this paper, an algorithm to solve the above program is proposed. The algorithm is based on solving a finite number of linear interval programs whose solutions techniques are well known. These optimal solutions then yield an optimal solution of the proposed pseudo-monotonic interval program. |