Abstract
The aim of this paper is to study a nondifferentiable multiobjective programming problem with inequality constraints. In this paper we introduce the concept of type-I ®- invex, weak strictly pseudo-quasi type-I ®-invex, strong pseudo-quasi type-I ®-invex, weak quasi-strictly-pseudo type-I ®-invex and weak strictly-pseudo type-I ®-invex functions. By utilizing these new notions we derive a Fritz John type sufficient optimality condition and establish Mond-Weir type and general Mond-Weir type duality results for the nondifferentiable multiobjective programming problem.
| Original language | English |
|---|---|
| Pages (from-to) | 317-331 |
| Number of pages | 15 |
| Journal | Applied Mathematics and Information Sciences |
| Volume | 2 |
| Issue number | 3 |
| Publication status | Published - 2008 |
| Externally published | Yes |
Keywords
- Convexity
- Duality.
- Nondifferentiable multiobjective programming
- Type-I ®-invexity
ASJC Scopus subject areas
- Analysis
- Numerical Analysis
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics