z-logo
open-access-imgOpen Access
Multiobjective duality withρ − (η, θ)‐invexity
Author(s) -
C. Nahak,
Santosh Kumar Nanda
Publication year - 2005
Publication title -
international journal of stochastic analysis
Language(s) - English
Resource type - Journals
eISSN - 2090-3340
pISSN - 2090-3332
DOI - 10.1155/jamsa.2005.175
Subject(s) - algorithm , duality (order theory) , mathematics , database , machine learning , computer science , artificial intelligence , combinatorics
Under ρ−(η,θ)-invexity assumptions on the functionsinvolved, weak, strong, and converse duality theorems are proved to relateproperly efficient solutions of the primal and dual problems for amultiobjective programming problem

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom