The purpose of this note is to unify various duality formulations in nonlinear programming. We show that this can be done by using a minmax formulation.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.