• Title/Summary/Keyword: Mond and Weir duality

Search Result 23, Processing Time 0.018 seconds

CONTINUOUS PROGRAMMING CONTAINING SUPPORT FUNCTIONS

  • Husain, I.;Jabeen, Z.
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.1_2
    • /
    • pp.75-106
    • /
    • 2008
  • In this paper, we derive necessary optimality conditions for a continuous programming problem in which both objective and constraint functions contain support functions and is, therefore, nondifferentiable. It is shown that under generalized invexity of functionals, Karush-Kuhn-Tucker type optimality conditions for the continuous programming problem are also sufficient. Using these optimality conditions, we construct dual problems of both Wolfe and Mond-Weir types and validate appropriate duality theorems under invexity and generalized invexity. A mixed type dual is also proposed and duality results are validated under generalized invexity. A special case which often occurs in mathematical programming is that in which the support function is the square root of a positive semidefinite quadratic form. Further, it is also pointed out that our results can be considered as dynamic generalizations of those of (static) nonlinear programming with support functions recently incorporated in the literature.

  • PDF

OPTIMALITY AND DUALITY IN NONDIFFERENTIABLE MULTIOBJECTIVE FRACTIONAL PROGRAMMING USING α-UNIVEXITY

  • Gupta, Rekha;Srivastava, Manjari
    • Journal of applied mathematics & informatics
    • /
    • v.32 no.3_4
    • /
    • pp.359-375
    • /
    • 2014
  • In this paper, a multiobjective nondifferentiable fractional programming problem (MFP) is considered where the objective function contains a term involving the support function of a compact convex set. A vector valued (generalized) ${\alpha}$-univex function is defined to extend the concept of a real valued (generalized) ${\alpha}$-univex function. Using these functions, sufficient optimality criteria are obtained for a feasible solution of (MFP) to be an efficient or weakly efficient solution of (MFP). Duality results are obtained for a Mond-Weir type dual under (generalized) ${\alpha}$-univexity assumptions.

SECOND ORDER NONSMOOTH MULTIOBJECTIVE FRACTIONAL PROGRAMMING PROBLEM INVOLVING SUPPORT FUNCTIONS

  • Kharbanda, Pallavi;Agarwal, Divya;Sinha, Deepa
    • Journal of applied mathematics & informatics
    • /
    • v.31 no.5_6
    • /
    • pp.835-852
    • /
    • 2013
  • In this paper, we have considered a class of constrained non-smooth multiobjective fractional programming problem involving support functions under generalized convexity. Also, second order Mond Weir type dual and Schaible type dual are discussed and various weak, strong and strict converse duality results are derived under generalized class of second order (F, ${\alpha}$, ${\rho}$, $d$)-V-type I functions. Also, we have illustrated through non-trivial examples that class of second order (F, ${\alpha}$, ${\rho}$, $d$)-V-type I functions extends the definitions of generalized convexity appeared in the literature.