Duality for non-differentiable multi-objective semi-infinite programming for higher order invex functions

Promila Kumar and Jyoti

International Journal of Mathematics in Operational Research, 2018, vol. 12, issue 4, 457-470

Abstract: This paper deals with non-differentiable multi-objective semi-infinite programming problem. It is a problem of simultaneous minimisation of finitely many scalar valued functions subject to an arbitrary (possibly infinite) set of constraints. Non-differentiability enters, due to the square root of a quadratic form which appears in the objective functional. Concept of efficiency of order m has been extended to the above stated problem. In order to study this new solution concept, the notion of ρ-invexity of order m is also proposed which is utilised to establish sufficient optimality conditions for the non-differentiable multi-objective semi-infinite programming problem. Mond-Weir type of dual is proposed for which weak, strong and strict converse duality theorems are established.

Keywords: optimality; duality; semi-infinite programming; non-differentiable programming; ρ -invexity of order m . (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=92105 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:12:y:2018:i:4:p:457-470

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().