Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

On Converse Duality for a Nondifferentiable Programming Problem

B. Mond
Operations Research
Vol. 25, No. 4 (Jul. - Aug., 1977), pp. 713-715
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/169575
Page Count: 3
  • Download ($30.00)
  • Cite this Item
On Converse Duality for a Nondifferentiable Programming Problem
Preview not available

Abstract

Some authors have assumed that the Kuhn-Tucker constraint qualification is always satisfied in a mathematical programming problem in which the nonlinear constraints define a convex set with nonempty interior. That this assumption is incorrect is shown by counterexample.

Page Thumbnails

  • Thumbnail: Page 
713
    713
  • Thumbnail: Page 
714
    714
  • Thumbnail: Page 
715
    715