.svg)
On generalised convex multi-objective nonsmooth programming
| dc.contributor.author | Mishra S.K.; Mukherjee R.N. | |
| dc.date.accessioned | 2025-05-24T09:56:36Z | |
| dc.description.abstract | We extend the concept of V-pseudo-invexity and V-quasi-invexity of multi-objective programming to the case of nonsmooth multi-objective programming problems. The generalised subgradient Kuhn-Tucker conditions are shown to be sufficient for a weak minimum of a multi-objective programming problem under certain assumptions. Duality results are also obtained. © Australian Mathematical Society, 1996. | |
| dc.identifier.doi | https://doi.org/10.1017/s0334270000000515 | |
| dc.identifier.uri | http://172.23.0.11:4000/handle/123456789/21189 | |
| dc.relation.ispartofseries | Journal of the Australian Mathematical Society Series B-Applied Mathematics | |
| dc.title | On generalised convex multi-objective nonsmooth programming |