Abstract
In this paper, first order and second order dual models for a class of nondifferentiable programming problems in which the objective function contains a support function of a compact convex set are formulated. Weak and converse duality theorems for the two dual models are established by using Fritz John necessary optimality conditions and some suitable conditions.
| Original language | English |
|---|---|
| Pages (from-to) | 113-124 |
| Number of pages | 12 |
| Journal | Pacific Journal of Optimization |
| Volume | 4 |
| Issue number | 1 |
| Publication status | Published - 1 Jan 2008 |
Keywords
- Duality theorems
- First and second order dual models
- Generalized convexity
- Nondifferentiable programming problems
ASJC Scopus subject areas
- Applied Mathematics
- Computational Mathematics
- Control and Optimization
Fingerprint
Dive into the research topics of 'On duality for a class of nondifferentiable programming problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver