• Title/Summary/Keyword: Multiobjective subset programming problem

Search Result 1, Processing Time 0.016 seconds

ON SUFFICIENCY AND DUALITY IN MULTIOBJECTIVE SUBSET PROGRAMMING PROBLEMS INVOLVING GENERALIZED $d$-TYPE I UNIVEX FUNCTIONS

  • Jayswal, Anurag;Stancu-Minasian, I.M.
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.1_2
    • /
    • pp.111-125
    • /
    • 2012
  • In this paper, we introduce new classes of generalized convex n-set functions called $d$-weak strictly pseudo-quasi type-I univex, $d$-strong pseudo-quasi type-I univex and $d$-weak strictly pseudo type-I univex functions and focus our study on multiobjective subset programming problem. Sufficient optimality conditions are obtained under the assumptions of aforesaid functions. Duality results are also established for Mond-Weir and general Mond-Weir type dual problems in which the involved functions satisfy appropriate generalized $d$-type-I univexity conditions.