معرفی
Robert G. Bland is a Professor at Cornell University's School of Operations Research and Information Engineering (ORIE). He earned his B.S., M.S., and Ph.D. in Operations Research from Cornell University (1969–1974). His career includes roles as Assistant Professor at SUNY Binghamton (1974–1978) and has been at Cornell since 1978, advancing to Full Professor. His research focuses on linear programming, combinatorial optimization, and algorithmic design, with notable contributions to the simplex method and matroid theory. He is affiliated with the Center for Applied Mathematics and holds memberships in the Mathematical Optimization Society and the American Society for Engineering Education.
Bland’s teaching spans optimization, game theory, and legislative mathematics. He has received prestigious awards, including the Sloan Foundation Fellowship (1978–1982), multiple Cornell Outstanding Educator Awards, and the McCormick Advising Award (2017). His service includes contributions to engineering education and final exam scheduling. He has authored influential papers in Mathematics of Operations Research, Journal of Combinatorial Theory, and Scientific American.
His research emphasizes duality theory, network flow algorithms, and applications in scheduling and resource allocation. Bland’s work bridges theoretical rigor with practical computational methods, shaping modern optimization practices.
