• Title/Summary/Keyword: duality theorems

Search Result 48, Processing Time 0.015 seconds

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.

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

MULTIOBJECTIVE FRACTIONAL SYMMETRIC DUALITY INVOLVING CONES

  • Ahmad, I.;Sharma, Sarita
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.1_2
    • /
    • pp.151-160
    • /
    • 2008
  • A pair of multiobjective fractional symmetric dual programs is formulated over arbitrary cones. Weak, strong and converse duality theorems are proved under pseudoinvexity assumptions. A self duality theorem is also discussed.

  • PDF

SYMMETRIC DUALITY FOR A CLASS OF NONDIFFERENTIABLE VARIATIONAL PROBLEMS WITH INVEXITY

  • LEE, WON JUNG
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.6 no.1
    • /
    • pp.67-80
    • /
    • 2002
  • We formulate a pair of nondifferentiable symmetric dual variational problems with a square root term. Under invexity assumptions, we establish weak, strong, converse and self duality theorems for our variational problems by using the generalized Schwarz inequality. Also, we give the static case of our nondifferentiable symmetric duality results.

  • PDF

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

OPTIMALITY AND DUALITY FOR NONDIFFERENTIABLE FRACTIONAL PROGRAMMING WITH GENERALIZED INVEXITY

  • Kim, Gwi Soo;Kim, Moon Hee
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.29 no.3
    • /
    • pp.465-475
    • /
    • 2016
  • We establish necessary and sufficient optimality conditions for a class of generalized nondifferentiable fractional optimization programming problems. Moreover, we prove the weak and strong duality theorems under (V, ${\rho}$)-invexity assumption.

OPTIMALITY AND DUALITY IN NONSMOOTH VECTOR OPTIMIZATION INVOLVING GENERALIZED INVEX FUNCTIONS

  • Kim, Moon-Hee
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.5_6
    • /
    • pp.1527-1534
    • /
    • 2010
  • In this paper, we consider nonsmooth optimization problem of which objective and constraint functions are locally Lipschitz. We establish sufficient optimality conditions and duality results for nonsmooth vector optimization problem given under nearly strict invexity and near invexity-infineness assumptions.