.svg)
On generalised convex multi-objective nonsmooth programming
| dc.contributor.author | Mishra, S.K. | |
| dc.contributor.author | Mukherjee, R.N. | |
| dc.date.accessioned | 2021-09-09T07:24:56Z | |
| dc.date.available | 2021-09-09T07:24:56Z | |
| dc.date.issued | 1996-07 | |
| 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. | en_US |
| dc.description.sponsorship | Journal of the Australian Mathematical Society Series B-Applied Mathematics | en_US |
| dc.identifier.issn | 03342700 | |
| dc.identifier.uri | https://idr-sdlib.iitbhu.ac.in/handle/123456789/1655 | |
| dc.language.iso | en | en_US |
| dc.publisher | Australian Mathematical Society | en_US |
| dc.relation.ispartofseries | Issue 1;Volume 38 | |
| dc.subject | V-pseudo-invexity; | en_US |
| dc.subject | V-quasi-invexity; | en_US |
| dc.subject | Kuhn-Tucker conditions; | en_US |
| dc.subject | multi-objective programming | en_US |
| dc.title | On generalised convex multi-objective nonsmooth programming | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- On-generalised-convex-multiobjective-nonsmooth-programmingJournal-of-the-Australian-Mathematical-Society-Series-BApplied-Mathematics.pdf
- Size:
- 313.46 KB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: