• Title/Summary/Keyword: Wolfe type duality

Search Result 21, Processing Time 0.021 seconds

ON SYMMETRIC DUALITY IN NONDIFFERENTIABLE MATHEMATICAL PROGRAMMING WITH F-CONVEXITY

  • AHMAD I.;HUSAIN Z.
    • Journal of applied mathematics & informatics
    • /
    • v.19 no.1_2
    • /
    • pp.371-384
    • /
    • 2005
  • Usual symmetric duality results are proved for Wolfe and Mond-Weir type nondifferentiable nonlinear symmetric dual programs under F-convexity F-concavity and F-pseudoconvexity F-pseudoconcavity assumptions. These duality results are then used to formulate Wolfe and Mond-Weir type nondifferentiable minimax mixed integer dual programs and symmetric duality theorems are established. Moreover, nondifferentiable fractional symmetric dual programs are studied by using the above programs.

ON VARIATIONAL PROBLEMS INVOLVING HIGHER ORDER DERIVATIVES

  • HUSAIN I.;JABEEN Z.
    • Journal of applied mathematics & informatics
    • /
    • v.17 no.1_2_3
    • /
    • pp.433-455
    • /
    • 2005
  • Fritz John, and Karush-Kuhn-Tucker type optimality conditions for a constrained variational problem involving higher order derivatives are obtained. As an application of these Karush-Kuhn-Tucker type optimality conditions, Wolfe and Mond-Weir type duals are formulated, and various duality relationships between the primal problem and each of the duals are established under invexity and generalized invexity. It is also shown that our results can be viewed as dynamic generalizations of those of the mathematical programming already reported in the literature.

OPTIMALITY CONDITIONS AND DUALITY IN NONDIFFERENTIABLE ROBUST OPTIMIZATION PROBLEMS

  • Kim, Moon Hee
    • East Asian mathematical journal
    • /
    • v.31 no.3
    • /
    • pp.371-377
    • /
    • 2015
  • We consider a nondifferentiable robust optimization problem, which has a maximum function of continuously differentiable functions and support functions as its objective function, continuously differentiable functions as its constraint functions. We prove optimality conditions for the nondifferentiable robust optimization problem. We formulate a Wolfe type dual problem for the nondifferentiable robust optimization problem and prove duality theorems.

MULTIOBJECTIVE CONTINUOUS PROGRAMMING CONTAINING SUPPORT FUNCTIONS

  • Husain, I.;Ahmed, A.;Rumana, G. Mattoo
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.3_4
    • /
    • pp.603-619
    • /
    • 2009
  • Wolfe and Mond-Weir type dual to a nondifferentiable continuous programming containing support functions are formulated and duality is investigated for these two dual models under invexity and generalized invexity. A close relationship of our duality results with those of nondifferentiable nonlinear programming problem is also pointed out.

  • PDF

ON DUALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS

  • Lee, Gue Myung;Kim, Moon Hee
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.26 no.4
    • /
    • pp.723-734
    • /
    • 2013
  • A robust optimization problem, which has a maximum function of continuously differentiable functions as its objective function, continuously differentiable functions as its constraint functions and a geometric constraint, is considered. We prove a necessary optimality theorem and a sufficient optimality theorem for the robust optimization problem. We formulate a Wolfe type dual problem for the robust optimization problem, which has a differentiable Lagrangean function, and establish the weak duality theorem and the strong duality theorem which hold between the robust optimization problem and its Wolfe type dual problem. Moreover, saddle point theorems for the robust optimization problem are given under convexity assumptions.

NONDIFFERENTIABLE SECOND ORDER SELF AND SYMMETRIC DUAL MULTIOBJECTIVE PROGRAMS

  • Husain, I.;Ahmed, A.;Masoodi, Mashoob
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.3_4
    • /
    • pp.549-561
    • /
    • 2008
  • In this paper, we construct a pair of Wolfe type second order symmetric dual problems, in which each component of the objective function contains support function and is, therefore, nondifferentiable. For this problem, we validate weak, strong and converse duality theorems under bonvexity - boncavity assumptions. A second order self duality theorem is also proved under additional appropriate conditions.

  • PDF

ROBUST DUALITY FOR NONSMOOTH MULTIOBJECTIVE OPTIMIZATION PROBLEMS

  • Lee, Gue Myung;Kim, Moon Hee
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.30 no.1
    • /
    • pp.31-40
    • /
    • 2017
  • In this paper, we consider a nonsmooth multiobjective robust optimization problem with more than two locally Lipschitz objective functions and locally Lipschitz constraint functions in the face of data uncertainty. We prove a nonsmooth sufficient optimality theorem for a weakly robust efficient solution of the problem. We formulate a Wolfe type dual problem for the problem, and establish duality theorems which hold between the problem and its Wolfe type dual problem.

ON DUALITY THEOREMS FOR MULTIOBJECTIVE PROGRAMS

  • Kim, Do-Sang;Lee, Gue-Myung
    • East Asian mathematical journal
    • /
    • v.5 no.2
    • /
    • pp.209-213
    • /
    • 1989
  • The efficiency(Pareto optimum) is a type of solutions for multiobjective programs. We formulate duality relations for multiobjective nonlinear programs by using the concept of efficiency. The results are the weak and strong duality relations for a vector dual of the Wolfe type involving invex functions.

  • PDF

MIXED TYPE DUALITY FOR CONTROL PROBLEMS WITH GENERALIZED INVEXITY

  • Husain, I.;Ahmed, A.;Ahmad, B.
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.5_6
    • /
    • pp.819-837
    • /
    • 2008
  • A mixed type dual to the control problem in order to unify Wolfe and Mond-Weir type dual control problem is presented in various duality results are validated and the generalized invexity assumptions. It is pointed out that our results can be extended to the control problems with free boundary conditions. The duality results for nonlinear programming problems already existing in the literature are deduced as special cases of our results.

  • PDF