Jump to content

Harold Benson

Add links
From Wikipedia, the free encyclopedia
Harold Philip Benson
Born1949
NationalityAmerican
Education
Occupation(s)mathematician, operations researcher, professor

Harold Philip Benson (born 1949) is an American operations researcher, mathematician, and professor. He is best known for his work in multiple-criteria decision making (MCDM)[1][2] and for formulating Benson's algorithm in the field of linear programming.[3][4] He served as an American Economic Institutions professor at the University of Florida.[2]

Education

[edit]

Benson graduated from the University of Michigan with a B.S. in Mathematics in 1971.[2] He was a member of the university's Phi Beta Kappa chapter.[3] He also earned an M.S. and PhD in Industrial Engineering and the Management Sciences from Northwestern University in 1973 and 1976, respectively.[2][3]

Career

[edit]

Benson worked as a research engineer at the General Motors Research Laboratory from 1976 to 1979.[3] After leaving his position at General Motors Research Laboratory in 1979, Benson was hired as a professor at the University of Florida’s Warrington College of Business, where he taught until 2013.[2][3]

Benson has served as an associate editor for academic journals such as the Journal of Mathematical Analysis and Applications, Naval Research Logistics, and the Journal of Optimization Theory and Applications.[2][3][5] Benson was also a founding member of the multiple-criteria decision making section of the Institute for Operations Research and the Management Sciences (INFORMS) when it was established in 2010.[3]

Research

[edit]

Benson's research mainly concerns multiple-criteria decision making (MCDM), global optimization, and their applications.[1][6][7] His work has been cited in more than 4,300 articles, books and research papers.[8]

He invented what is now called Benson's algorithm, which finds all of the efficient extreme points and the full weakly efficient set in the outcome set of a multiple objective linear program.[1][2][9][10] A computer code called BENSOLVE was developed to execute this algorithm.[11]

Benson also helped to define and explore properly efficient solutions of nonlinear vector optimization problems.[12][13][14] In global optimization, he focused a good portion of his work on the theory and solutions for concave minimization problems.[15][16] During the 1990s, Benson's MCDM work included research on optimization over the efficient set and on generating the complete set of efficient and extreme point efficient solutions in the decision and criterion spaces of multiple objective mathematical programming problems.[1]

Awards and honors

[edit]

In 2004, Benson received the Georg Cantor Award from the International Society on Multiple Criteria Decision Making for his contributions to the theory, methodology, and practices of multiple-criteria decision making.[1][3]

In the book Multiple Criteria Decision Making: From Early History to the 21st Century, which was published in 2011, Benson was named one of the 42 world-leading researchers in the history of MCDM.[1][2] In 2018, a special issue of the Journal of Optimization Theory and Applications was dedicated to Benson.[3]

Select publications

[edit]
  • Benson, H. P. (1979). An improved definition of proper efficiency for vector maximization with respect to cones. Journal of Mathematical Analysis and Applications, 71(1), 232–241.[17]
  • Benson, H. P. (1998). An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. Journal of Global Optimization, 13, 1-24.[18]
  • Benson, H. P. (1978). Existence of efficient solutions for vector maximization problems. Journal of Optimization Theory and Applications, 26, 569–580.[19]
  • Benson, H. P. (1984). Optimization over the efficient set. Journal of Mathematical Analysis and Applications, 98(2), 562–580.
  • Benson, H. P. (1995). Concave minimization: theory, applications and algorithms. Handbook of global optimization, 43–148.[20]

References

[edit]
  1. ^ a b c d e f Koksalan, Murat; Wallenius, Jyrki; Zionts, Stanley (2011-06-06). Multiple Criteria Decision Making: From Early History To The 21st Century. World Scientific. ISBN 978-981-4462-23-5.
  2. ^ a b c d e f g h Martinovich, Milenko (2011-12-07). "Benson recognized as one of his field's top scholars in new book". UF Warrington News. Retrieved 2023-04-15.
  3. ^ a b c d e f g h i Chen, Guangya; Li, Shengjie; Xu, Jiuping; Yang, Xinmin (June 2018). "Dedication to Benson". Journal of Optimization Theory and Applications. 177 (3): 606–608. doi:10.1007/s10957-018-1315-4. S2CID 254752917.
  4. ^ Ehrgott, Matthias; Löhne, Andreas; Shao, Lizhen (April 2012). "A dual variant of Benson's 'outer approximation algorithm' for multiple objective linear programming". Journal of Global Optimization. 52 (4): 757–778. doi:10.1007/s10898-011-9709-y. S2CID 254649300.
  5. ^ Tour, Schedule a Campus. "Editorial Board Activity". Information Systems and Operations Management Department. Retrieved 2023-04-15.
  6. ^ Benson, H. P. (January 2002). "Global Optimization Algorithm for the Nonlinear Sum of Ratios Problem". Journal of Optimization Theory and Applications. 112 (1): 1–29. doi:10.1023/A:1013072027218. S2CID 121739598.[non-primary source needed]
  7. ^ Benson, H. P. (April 2004). "On the Global Optimization of Sums of Linear Fractional Functions over a Convex Set". Journal of Optimization Theory and Applications. 121 (1): 19–39. doi:10.1023/B:JOTA.0000026129.07165.5a. S2CID 120025863.[non-primary source needed]
  8. ^ "H. P. Benson". scholar.google.com. Retrieved 2023-04-15.
  9. ^ Benson, Harold P. (1998). "An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem". Journal of Global Optimization. 13 (1): 1–24. doi:10.1023/A:1008215702611. S2CID 45440728.[non-primary source needed]
  10. ^ Löhne, Andreas (2011). Vector Optimization with Infimum and Supremum. Vector Optimization. doi:10.1007/978-3-642-18351-5. ISBN 978-3-642-18350-8.[page needed]
  11. ^ "BENSOLVE - A Free Vector Linear Program Solver". users.fmi.uni-jena.de. Retrieved 2023-04-15.
  12. ^ Benson, Harold P (September 1979). "An improved definition of proper efficiency for vector maximization with respect to cones". Journal of Mathematical Analysis and Applications. 71 (1): 232–241. doi:10.1016/0022-247X(79)90226-9.[non-primary source needed]
  13. ^ Benson, H. P. (December 1978). "Existence of efficient solutions for vector maximization problems". Journal of Optimization Theory and Applications. 26 (4): 569–580. doi:10.1007/BF00933152. S2CID 121336616.[non-primary source needed]
  14. ^ Benson, Harold P (April 1983). "Efficiency and proper efficiency in vector maximization with respect to cones". Journal of Mathematical Analysis and Applications. 93 (1): 273–289. doi:10.1016/0022-247X(83)90230-5.[non-primary source needed]
  15. ^ Benson, Harold P. (1995). "Concave Minimization: Theory, Applications and Algorithms". Handbook of Global Optimization. Nonconvex Optimization and Its Applications. Vol. 2. pp. 43–148. doi:10.1007/978-1-4615-2025-2_3. ISBN 978-1-4613-5838-1.[non-primary source needed]
  16. ^ Benson, Harold P. (1996). "Deterministic algorithms for constrained concave minimization: A unified critical survey". Naval Research Logistics. 43 (6): 765–795. doi:10.1002/(SICI)1520-6750(199609)43:6<765::AID-NAV1>3.0.CO;2-2.[non-primary source needed]
  17. ^ Benson, Harold P (1979-09-01). "An improved definition of proper efficiency for vector maximization with respect to cones". Journal of Mathematical Analysis and Applications. 71 (1): 232–241. doi:10.1016/0022-247X(79)90226-9. ISSN 0022-247X.
  18. ^ Benson, Harold P. (1998-01-01). "An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem". Journal of Global Optimization. 13 (1): 1–24. doi:10.1023/A:1008215702611. ISSN 1573-2916.
  19. ^ Benson, H. P. (1978-12-01). "Existence of efficient solutions for vector maximization problems". Journal of Optimization Theory and Applications. 26 (4): 569–580. doi:10.1007/BF00933152. ISSN 1573-2878.
  20. ^ Benson, Harold P. (1995), Horst, Reiner; Pardalos, Panos M. (eds.), "Concave Minimization: Theory, Applications and Algorithms", Handbook of Global Optimization, Boston, MA: Springer US, pp. 43–148, doi:10.1007/978-1-4615-2025-2_3, ISBN 978-1-4615-2025-2, retrieved 2023-05-09
Retrieved from "https://en.wikipedia.org/w/index.php?title=Harold_Benson&oldid=1179111972"