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.

Topics include computational linear algebra, first and second order descent methods, convex sets and functions, basics of linear and semidefinite programming, optimization for statistical regression ...

In the early 1950s, Dantzig started working for Rand Corp., where he played a major role in developing the new discipline of operations research using linear programming.

In this note we use the concept of intersection cut, introduced by Balas for integer programming problems, to develop a cutting-plane algorithm for solving integer interval linear programming problems ...

Roth, A. E., U. G. Rothblum, and J. H. Vande Vate. "Stable Matchings, Optimal Assignments, and Linear Programming." Mathematics of Operations Research 18, no. 4 ...

Marshall, Paul W. "Linear Programming: A Technique for Analyzing Resource Allocation Problems." Harvard Business School Background Note 171-322, January 1971. (Revised November 1975 ...

With over 12,500 members from around the globe, INFORMS is the leading international association for professionals in operations research and analytics. INFORMS promotes best practices and advances in ...