Perfect duality for convexlike programs

M. Hayashi, H. Komiya

Research output: Contribution to journalArticlepeer-review

54 Citations (Scopus)


The minimizing problem for a convex program has a dual problem, that is, the maximizing problem of the Lagrangian. Although these problems have a duality gap in general, the duality gap can be eliminated by relaxing the constraint of the minimizing problem, so that the constraint is enforced only in the limit. We extend this result to the convexlike case. Moreover, we obtain a necessary condition for optimality for minimizing problems whose objective function and constraint mapping have convex Gateaux derivative.

Original languageEnglish
Pages (from-to)179-189
Number of pages11
JournalJournal of Optimization Theory and Applications
Issue number2
Publication statusPublished - 1982 Oct
Externally publishedYes


  • Convexlike programs
  • Lagrangian function
  • necessary condition for optimality
  • perfect duality

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Control and Optimization
  • Applied Mathematics


Dive into the research topics of 'Perfect duality for convexlike programs'. Together they form a unique fingerprint.

Cite this