( V , ρ ) invexity and non-smooth multiobjective programming

D. Bhatia; Pankaj Kumar Garg

RAIRO - Operations Research - Recherche Opérationnelle (1998)

  • Volume: 32, Issue: 4, page 399-414
  • ISSN: 0399-0559

How to cite

top

Bhatia, D., and Pankaj Kumar Garg. "$(V, \rho )$ invexity and non-smooth multiobjective programming." RAIRO - Operations Research - Recherche Opérationnelle 32.4 (1998): 399-414. <http://eudml.org/doc/105178>.

@article{Bhatia1998,
author = {Bhatia, D., Pankaj Kumar Garg},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
language = {eng},
number = {4},
pages = {399-414},
publisher = {EDP-Sciences},
title = {$(V, \rho )$ invexity and non-smooth multiobjective programming},
url = {http://eudml.org/doc/105178},
volume = {32},
year = {1998},
}

TY - JOUR
AU - Bhatia, D.
AU - Pankaj Kumar Garg
TI - $(V, \rho )$ invexity and non-smooth multiobjective programming
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1998
PB - EDP-Sciences
VL - 32
IS - 4
SP - 399
EP - 414
LA - eng
UR - http://eudml.org/doc/105178
ER -

References

top
  1. 1. D. BHATIA and P. JAIN, Generalized (F, P)-Convexity and Duality for Non-smooth Multiobjective Programming, Optimization, 1994, 31, pp. 153-164. Zbl0819.90082
  2. 2. C. R. BECTOR, S. CHANDRAand V. KUMAR, Duality for Minmax Programming Involving V-Invex Functions, Optimization, 1994, 30, pp. 93-103. Zbl0816.49028MR1285099
  3. 3. V. CHANKONGand Y. Y. HAIMES, Multiobjective Decision Making, Theory and Methodology, North-Holland, New York. Zbl0622.90002MR780745
  4. 4. F. H. CLARKE, Optimization and Non-smooth Analysis, Wiley-Interscience, New York, Numerical Analysis and Application Sciences, 1983, pp. 514-550. 
  5. 5. R. R. EGUDO, Efficiency and Generalized Convex Duality for Multiobjective Programs, Journal of Mathematical Analysis and Applications, 1989, 138, pp. 184-194. Zbl0686.90039MR988321
  6. 6. M. M. HANSON, On Sufficiency of Kuhn-Tucker Conditions, Journal of Mathematical Analysis and Applications, 1981, 80, pp. 544-550. Zbl0463.90080MR614849
  7. 7. M. A. HANSON and B. MOND, Furhter Generalization of Convexity in Mathematical Programming, Journal Information and Optimization Science, 1982, 4, pp. 25-32. Zbl0475.90069MR713163
  8. 8. V. JEYAKUMAR, Strong and Weak Invexity in Mathematical Programming, Method Oper. Res., 1985, 55, pp. 109-125. Zbl0566.90086MR811672
  9. 9. V. JEYAKUMAR, Equivalence of Saddle Points and Optima, and Duality for a Class of Non-convex Problems, Journal of Mathematical Analysis and Application, 1988, 130, pp. 334-343. Zbl0642.49018MR929939
  10. 10. V. JEYAKUMAR and B. MOND, On Generalized Convex Mathematical Programming, Journal of Austral. Math. Soc. (Ser. B), 1992, 34, pp. 43-53. Zbl0773.90061MR1168574
  11. 11. V. PREDA, On Efficiency and Duality for Multiobjective Programs, Journal of Mathematical Analysis and Application, 1992, 166, pp. 365-377. Zbl0764.90074MR1160932
  12. 12. Y. TANAKA M. FUKUSHIMA and T. IBARAKI, On Generalized Pseudo Convex Functions, Journal of Math. Analysis and Application, 1989, 144, pp. 342-355. Zbl0685.90089MR1027040
  13. 13. P. WOLFE, A Duality Theorem for Nonlinear Programming, Quarterly Application Math., 1961, 19, pp. 239-244. Zbl0109.38406MR135625

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.