• Title/Summary/Keyword: Wolfe dual problem

Search Result 13, Processing Time 0.016 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 CRITERIA AND DUALITY FOR MULTIOBJECTIVE VARIATIONAL PROBLEMS INVOLVING HIGHER ORDER DERIVATIVES

  • Husain, I.;Ahmed, A.;Rumana, G. Mattoo
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.1_2
    • /
    • pp.123-137
    • /
    • 2009
  • A multiobjective variational problem involving higher order derivatives is considered and Fritz-John and Karush-Kuhn-Tucker type optimality conditions for this problem are derived. As an application of Karush-Kuhn-Tucker optimality conditions, Wolfe type dual to this variational problem is constructed and various duality results are validated under generalized invexity. Some special cases are mentioned and it is also pointed out that our results can be considered as a dynamic generalization of the already existing results in nonlinear programming.

  • PDF

OPTIMALITY CONDITIONS AND DUALITY MODELS FOR MINMAX FRACTIONAL OPTIMAL CONTROL PROBLEMS CONTAINING ARBITRARY NORMS

  • G. J., Zalmai
    • Journal of the Korean Mathematical Society
    • /
    • v.41 no.5
    • /
    • pp.821-864
    • /
    • 2004
  • Both parametric and parameter-free necessary and sufficient optimality conditions are established for a class of nondiffer-entiable nonconvex optimal control problems with generalized fractional objective functions, linear dynamics, and nonlinear inequality constraints on both the state and control variables. Based on these optimality results, ten Wolfe-type parametric and parameter-free duality models are formulated and weak, strong, and strict converse duality theorems are proved. These duality results contain, as special cases, similar results for minmax fractional optimal control problems involving square roots of positive semi definite quadratic forms, and for optimal control problems with fractional, discrete max, and conventional objective functions, which are particular cases of the main problem considered in this paper. The duality models presented here contain various extensions of a number of existing duality formulations for convex control problems, and subsume continuous-time generalizations of a great variety of similar dual problems investigated previously in the area of finite-dimensional nonlinear programming.