Scholion.ai

Technical Note—On a Duality Theorem for a Nonlinear Programming Problem

Bertram Mond

Operations Research · 1973 · Volume 21 · Issue 1

DOI: 10.1287/opre.21.1.369

Abstract

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

Enable JavaScript for citation tools and additional paper interactions.