Profiles in Operations Research pp 693-705 | Cite as

# Ralph E. Gomory

## Abstract

Observers of operations research(OR) in the 1950s were faced with a curious phenomenon: While OR was established in some departments of industrial engineering and a few schools of business, it continued to be ignored by mainstream, scientifically oriented departments, especially mathematics departments. This seemed strange as OR rests heavily on aspects of both theoretical and applied mathematics. This explains how, in those days, Ralph Gomory, a student with both a B.A. (Williams College, 1950) and Ph.D. (Princeton University, 1954) in mathematics, could leave the academic environment without ever hearing of OR. Soon after, however, he was introduced to OR while on naval duty with the Office of Naval Research (ONR). He then worked for IBM’s Research Division, rising to the positions of Director of Research and Senior Vice-President for Science and Technology.

## Keywords

Integer Programming Problem Unit Production Cost Sloan Foundation Linear Programming Solution Williams College## References

- Aráoz J, Evans L, Gomory RE, Johnson E (2003) Cyclic group and knapsack facets. Math Program Ser B 96(2):377–408CrossRefGoogle Scholar
- Courant R, Robbins H (1941) What is mathematics? Oxford University Press, New York, NYGoogle Scholar
- Gilmore P, Gomory RE (1961) A linear programming approach to the cutting stock problem—part I. Oper Res 9(6):849–859CrossRefGoogle Scholar
- Gilmore P, Gomory RE (1963) A linear programming approach to the cutting stock problem—part II. Oper Res 11(6):863–888CrossRefGoogle Scholar
- Goldstine H (1987) Reflections on the early days of the department. IBM J Res Dev 31(2):154–157CrossRefGoogle Scholar
- Gomory RE (1955) Trajectories tending to a critical point in 3-Space. Ann Math Sec Ser 61(1):140–153CrossRefGoogle Scholar
- Gomory RE (1956) Critical points at infinity and forced oscillation. In: Lefschetz S (ed) Contributions to the theory of nonlinear oscillations, Annals of Mathematics Studies, vol. 3. No. 36, Princeton University Press, Princeton, NJ, pp 85–126Google Scholar
- Gomory RE (1958) Outline of an algorithm for integer solutions to linear programs. Bull Am Math Soc 64(5):275–278CrossRefGoogle Scholar
- Gomory RE (1960) Solving linear programming problems in integers. Proc Symp Appl Math 10(July):211–215Google Scholar
- Gomory RE (1963) An algorithm for integer solutions to linear programs. In: Graves R, Wolfe P (eds) Recent advances in mathematical programming. McGraw-Hill, New York, NY, pp 269–302Google Scholar
- Gomory RE (1965) On the relation between integer and noninteger solutions to linear programs. Proc Natl Acad Sci 53:260–263CrossRefGoogle Scholar
- Gomory RE (1967) Faces of an integer polyhedron. Proc Natl Acad Sci 57(1):16–18CrossRefGoogle Scholar
- Gomory RE (1969) Some polyhedra related to combinatorial problems. Linear Algebra Appl 2(4):451–558CrossRefGoogle Scholar
- Gomory RE (1987) Science in industry. IBM J Res Dev 31(2):151–153CrossRefGoogle Scholar
- Gomory RE (1993) Let them eat chips. Bridge 23(4):13–16Google Scholar
- Gomory RE (2002) Early integer programming. Oper Res 50(1):78–81CrossRefGoogle Scholar
- Gomory RE, Balinski M (1963) A mutual-primal-dual simplex method. In: Graves R, Wolfe P (eds) Recent advances in mathematical programming (Proceedings of the 1962 Symposium for Mathematical Programming), McGraw-Hill, New York, NY, pp 17–26Google Scholar
- Gomory RE, Baumol W (1960) Integer programming and pricing. Econometrica 28(3):521–550CrossRefGoogle Scholar
- Gomory RE, Baumol W (2001) Global trade and conflicting national interests. MIT Press, Cambridge, MAGoogle Scholar
- Gomory RE, Haas F (1955) A study of trajectories which tend to a limit cycle in three-space. Ann Math 62(1):152–161CrossRefGoogle Scholar
- Gomory RE, Hoffman A (1963) On the convergence of an integer-programming process. Nav Res Logistics Q 10(2):121–123CrossRefGoogle Scholar
- Gomory RE, Hu T (1961) Multi-terminal network flows. J Soc Ind Appl Math 9(4):551–570CrossRefGoogle Scholar
- Gomory RE, Hu T (1962) An application of generalized linear programming to network flows. J Soc Indust Appl Math 10(2):260–283CrossRefGoogle Scholar
- Gomory RE, Johnson E (1973) The group problems and subadditive functions. In: Hu T, Robinson R (eds) Mathematical programming. Academic, New York, NY, pp 157–184Google Scholar
- Gomory RE, Johnson E (2003) T-space and cutting planes. Math Program Ser B 96(2):341–375CrossRefGoogle Scholar
- Gomory RE, Johnson E, Evans L (2003) Corner polyhedra and their connection with cutting planes. Math Program Ser B 96(2):321–339CrossRefGoogle Scholar
- Gomory RE, Richmond D (1951) Boundaries for the limit cycle of Van der Pol’s equation. Q Appl Math 9(2):205–209Google Scholar
- Johnson E (1974) On the group problem for mixed integer programming. In: Balinski ML (ed) Math Program Study 2:137–179Google Scholar
- Johnson E (2005) IFORS’ operational research hall of fame: Ralph E. Gomory. Int Trans Oper Res 12(5):539–543CrossRefGoogle Scholar
- Land A, Doig A (1960) An automatic method for solving discrete programming problems. Econometrica 28(3):497–520CrossRefGoogle Scholar
- MIT Press (2009) http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=3682. Accessed 25 Jan 2009
- National Science Foundation (1988) The President’s National Medal of Science: Recipient details. http://www.nsf.gov/od/nms/recip_details.cfm?recip_id=144. Accessed 27 Jan 2009
- Paull A (1956) A key to optimum newsprint production. Pulp Paper Mag Can 57(4):145–150Google Scholar
- Van der Pol B, van der Mark J (1928) The heartbeat considered as a relaxation oscillation, and an electrical model of the heart. Lond Edin Dublin Phil Mag J 7(6):763–765Google Scholar