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.

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.

[1] Recent contributions to linear semi-infinite optimization: an update. Annals of Operations Research (2018). [2] Recent advances in nonconvex semi-infinite programming: Applications and algorithms.

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

In 1991, linear programming was thought to be a mature field. From 1991 through 1998, linear programming performance improved dramatically.

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

“The Decomposition Algorithm for Linear Programming.” Econometrica 29 (4): 767–778. Dantzig, G. 2002. “Linear Programming.” Operations Research 50 (1): 42–47. Greenwood. D. 2006. “Commensurability and ...