An interval linear program is (IP):maximize c tx, subject b - ≤ Ax ≤ b + where the matrix A, vectors b -, b + and c are given. If A has full row rank, the optimal solutions of (IP) can be written ...

Addressing the importance of the algorithm design process, Deterministic Operations Research focuses on the design of solution methods for both continuous and discrete linear optimization problems.