PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Powiadomienia systemowe
  • Sesja wygasła!
Tytuł artykułu

On multiobjective nonlinear programming with support functions

Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
A multiobjective programming problem containing support functions is considered. Wolfe and Mond-Weir type vector duals to this problem are constructed and various duality results are validated under invexity and generalized invexity assumptions. Special cases are generated from these results.
Wydawca
Rocznik
Strony
171--187
Opis fizyczny
Bibliogr. 18 poz.
Twórcy
autor
autor
autor
Bibliografia
  • [1] Chankong, V., Haimes, Y. Y., Multiobjective Decision Making: Theory and Methodology, North-Holland, New York (1983).
  • [2] Chandra, S., Craven, B.D., Husain, I., A class of nondifferentiable continuous programming problem, J. Math. Anal. Appl. 107(1985), 122-131.
  • [3] Clarke, F. H., Optimization and Non-smooth Analysis, Wiley, New York (1983).
  • [4] Craven, B. D., Lagrangian conditions and quasiduality. Bulletin of Australian Mathematical Society 16(1977), 325-339.
  • [5] Demyanov, V.F., Dixon, L.C.W., Quasidifferential calculus. Mathematical Programming Study 29, North Holland, Amsterdam (1989).
  • [6] Dennis, J. B., Mathematical programming and electric network, Wiley, New York (1959).
  • [7] Dorn, W. S., A symmetric dual theorem for quadratic programs. Journal of Operations Society of Japan 2(1960), 93-97.
  • [8] Geofferion, A. M., Proper efficiency and the theory of vector maximization. Journal of Mathematical Analysis and Applications 22, 618-730.
  • [9] Husain, I., Abha, Jabeen, Z., On nonlinear programming with support function, J. Appl. Math and Computing 10(1-2) (2002), 83-99.
  • [10] Kanniappan, P., Necessary conditions for optimality of nondifferentiable convex multiobjective programming. Journal of Optimization Theory and Applications 40(1983), 167-174.
  • [11] Kuhn H. W., Tucker, A. W., Nonlinear programming, in Proceeding of Second Berkley Symposium on Mathematical Statistics and Probability (J.Newman, ed.). University of California Press, Berkley, California (1951), 481-492.
  • [12] Lai, H. C, Ho, C. P., Duality theorem of nondifferentiable convex multiobjective programming. Journal of Optimization Theory and Applications 58(1986), 407-420.
  • [13] Mangasarian, O. L., Nonlinear Programming, McGraw Hill, New York (1969).
  • [14] Mond, B., Husain, I., Durga Prasad, M. V., Duality for a class of nondifferentiable multiple objective programming problems. Journal of Information and Sciences 9(1988), 331-341.
  • [15] Mond, B., Schechter, M., Nondifferentiable symmetric duality. Bull. Autral. Math. Soc. 53(1996), 177-188.
  • [16] Weir, T., Proper efficiency and duality for vector valued optimization problems. The Jounal of the Australian Mathematical Society (Series A) 43(1987), 21-34.
  • [17] Weir, T., Jeyakumar, V., A class of nonconvex functions and mathematical programming. Bulletin of the Australian Mathematical Society 39(1988), 177-189.
  • [18] Weir,T., Mond, B., Generalized convexity and duality in multiple objective programming. Bulletin of the Australian Mathematical Society 39(1989), 287-299.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-LOD7-0033-0001
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.