| Article ID: | iaor1991309 |
| Country: | India |
| Volume: | 11 |
| Issue: | 2 |
| Start Page Number: | 319 |
| End Page Number: | 326 |
| Publication Date: | May 1990 |
| Journal: | Journal of Information & Optimization Sciences |
| Authors: | Singh Chanchal |
| Keywords: | programming: nonlinear |
The notion of convex programming with set inclusive constraints and objective set is extended and generalized from a linear, scalar valued case to nonlinear multiobjective programming with nonlinear constraints. No differentiability or subdifferentiability is required. Any form of convexity is not needed either. Some strong vector duality results are established without any scalarization.