Multiobjective duality with Ï âˆ’ ( η, θ ) -invexity

C. Nahak and S. Nanda

International Journal of Stochastic Analysis, 2005, vol. 2005, 1-6

Abstract:

Under Ï âˆ’ ( η , θ ) -invexity assumptions on the functions involved, weak, strong, and converse duality theorems are proved to relate properly efficient solutions of the primal and dual problems for a multiobjective programming problem.

Date: 2005
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJSA/2005/395727.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJSA/2005/395727.xml (text/xml)

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:hin:jnijsa:395727

DOI: 10.1155/JAMSA.2005.175

Access Statistics for this article

More articles in International Journal of Stochastic Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().