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 a Duality Theorem for a Nonlinear Programming Problem

Bertram Mond
Operations Research
Vol. 21, No. 1, Mathematical Programming and Its Applications (Jan. - Feb., 1973), pp. 369-370
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/169125
Page Count: 2
  • Download ($30.00)
  • Cite this Item
Preview not available
Preview not available

Abstract

Duality theorems were given recently for a mathematical program with a non-linear nondifferentiable objective function. Here we point out that the converse dual theorem holds without the usually stated restrictions and assumptions.

Page Thumbnails

  • Thumbnail: Page 
369
    369
  • Thumbnail: Page 
370
    370