• 제목/요약/키워드: generalized invexity

검색결과 26건 처리시간 0.027초

GLOBAL PARAMETRIC SUFFICIENT OPTIMALITY CONDITIONS FOR DISCRETE MINMAX FRACTIONAL PROGRAMMING PROBLEMS CONTAINING GENERALIZED $({\theta},\;{\eta},\;{\rho})-V-INVEX$ FUNCTIONS AND ARBITRARY NORMS

  • Zalmai, G.J.
    • Journal of applied mathematics & informatics
    • /
    • 제23권1_2호
    • /
    • pp.1-23
    • /
    • 2007
  • The purpose of this paper is to develop a fairly large number of sets of global parametric sufficient optimality conditions under various generalized $({\theta},\;{\eta},\;{\rho})-V-invexity$ assumptions for a discrete minmax fractional programming problem involving arbitrary norms.

ON VARIATIONAL PROBLEMS INVOLVING HIGHER ORDER DERIVATIVES

  • HUSAIN I.;JABEEN Z.
    • Journal of applied mathematics & informatics
    • /
    • 제17권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 RESULTS OF THE NONLINEAR PROGRAMMING PROBLEMS UNDER ρ-(p, r)-INVEXITY ON DIFFERENTIABLE MANIFOLDS

  • Jana, Shreyasi;Nahak, Chandal
    • Journal of applied mathematics & informatics
    • /
    • 제32권3_4호
    • /
    • pp.491-502
    • /
    • 2014
  • In this paper, by using the notion of ${\rho}$-(p,r)-invexity assumptions on the functions involved, optimality conditions and duality results (Mond-Weir, Wolfe and mixed type) are established on differentiable manifolds. Counterexample is constructed to justify that our investigations are more general than the existing work available in the literature.

MULTIOBJECTIVE CONTINUOUS PROGRAMMING CONTAINING SUPPORT FUNCTIONS

  • Husain, I.;Ahmed, A.;Rumana, G. Mattoo
    • Journal of applied mathematics & informatics
    • /
    • 제27권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 SUFFICIENT OPTIMALITY THEOREMS FOR NONSMOOTH MULTIOBJECTIVE OPTIMIZATION PROBLEMS

  • Kim, Moon-Hee;Lee, Gue-Myung
    • 대한수학회논문집
    • /
    • 제16권4호
    • /
    • pp.667-677
    • /
    • 2001
  • We consider a nonsmooth multiobjective opimization problem(PE) involving locally Lipschitz functions and define gen-eralized invexity for locally Lipschitz functions. Using Fritz John type optimality conditions, we establish Fritz John type sufficient optimality theorems for (PE) under generalized invexity.

  • PDF

OPTIMALITY AND DUALITY IN NONSMOOTH VECTOR OPTIMIZATION INVOLVING GENERALIZED INVEX FUNCTIONS

  • Kim, Moon-Hee
    • Journal of applied mathematics & informatics
    • /
    • 제28권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.

GENERALIZED INVEXITY AND DUALITY IN MULTIOBJECTIVE NONLINEAR PROGRAMMING

  • Das, Laxminarayan;Nanda, Sudarsan
    • Journal of applied mathematics & informatics
    • /
    • 제11권1_2호
    • /
    • pp.273-281
    • /
    • 2003
  • The purpose of this paper is to study the duality theorems in cone constrained multiobjective nonlinear programming for pseudo-invex objectives and quasi-invex constrains and the constraint cones are arbitrary closed convex ones and not necessarily the nonnegative orthants.

PARAMETRIC DUALITY MODELS FOR DISCRETE MINMAX FRACTIONAL PROGRAMMING PROBLEMS CONTAINING GENERALIZED(${\theta},{\eta},{\rho}$)-V-INVEX FUNCTIONS AND ARBITRARY NORMS

  • Zalmai, G.J.
    • Journal of applied mathematics & informatics
    • /
    • 제24권1_2호
    • /
    • pp.105-126
    • /
    • 2007
  • The purpose of this paper is to construct several parametric duality models and prove appropriate duality results under various generalized (${\theta},{\eta},{\rho}$)-V-invexity assumptions for a discrete minmax fractional programming problem involving arbitrary norms.