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 ...

Michael O. Nyong, DYNAMIC LINEAR PROGRAMMING FOR BANK FINANCIAL PLANNING IN A LESS DEVELOPED ECONOMY, African Review of Money Finance and Banking, No. 1 (1989), pp. 17-33 ...

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.