The Khachiyan Prize of the INFORMS Optimization Society was
established in 2010 and is awarded annually at the fall INFORMS Annual Meeting to an individual or a team for life-time achievements in the
area of optimization. The award recognizes a sustained career of
scholarship from nominees who are still active at the year of the
nomination. The prize serves as an esteemed recognition of
innovativeness and impact in the area of optimization, including theory
and applications. Recipients of the INFORMS John von Neumann Theory
Prize or the MPS/SIAM Dantzig Prize in prior years are not eligible for
the Khachiyan Prize.
The award includes a cash amount of $1,000
and a citation certificate. The award winner(s) will be invited to give a
thirty minute presentation at the INFORMS National Meeting in Houston, TX in October 2017. The winners will be responsible for all travel expenses associated with the presentation of their paper at the INFORMS meeting. Award winners are also asked to contribute an article about their award-winning work to the annual Optimization Society newsletter.
Using the ellipsoid algorithm, in 1979, Leonid Khachiyan was the
first to prove that linear optimization can be solved in polynomial
time. Read more about Leonid Khachiyan and the importance of his work in optimization.
The nominee(s) and their work must satisfy the following conditions:
- The Khachiyan Prize is awarded for outstanding life-time
contributions to the field of optimization by an individual or team.
- The topic of the contribution must belong to the field of optimization in its broadest sense.
- Recipients of the INFORMS John von Neumann Theory Prize or the
MPS/SIAM Dantzig Prize in prior years are not eligible for the Khachiyan
- The prize may be awarded once in a lifetime to any individual.
Nominations should be submitted to the Chair of the committee, Gerald Brown, by email at GBrown@nps.edu, on or before June 15, 2017.
Other committee members: Bill Cook, Andrzej Ruszczyński, and Yinyu Ye.