• Title/Summary/Keyword: necessary conditions of optimality

Search Result 58, Processing Time 0.023 seconds

ON SECOND ORDER NECESSARY OPTIMALITY CONDITIONS FOR VECTOR OPTIMIZATION PROBLEMS

  • Lee, Gue-Myung;Kim, Moon-Hee
    • Journal of the Korean Mathematical Society
    • /
    • v.40 no.2
    • /
    • pp.287-305
    • /
    • 2003
  • Second order necessary optimality condition for properly efficient solutions of a twice differentiable vector optimization problem is given. We obtain a nonsmooth version of the second order necessary optimality condition for properly efficient solutions of a nondifferentiable vector optimization problem. Furthermore, we prove a second order necessary optimality condition for weakly efficient solutions of a nondifferentiable vector optimization problem.

INVEXITY AS NECESSARY OPTIMALITY CONDITION IN NONSMOOTH PROGRAMS

  • Sach, Pham-Huu;Kim, Do-Sang;Lee, Gue-Myung
    • Journal of the Korean Mathematical Society
    • /
    • v.43 no.2
    • /
    • pp.241-258
    • /
    • 2006
  • This paper gives conditions under which necessary optimality conditions in a locally Lipschitz program can be expressed as the invexity of the active constraint functions or the type I invexity of the objective function and the constraint functions on the feasible set of the program. The results are nonsmooth extensions of those of Hanson and Mond obtained earlier in differentiable case.

NECESSARY AND SUFFICIENT OPTIMALITY CONDITIONS FOR FUZZY LINEAR PROGRAMMING

  • Farhadinia, Bahram
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.1_2
    • /
    • pp.337-349
    • /
    • 2011
  • This paper is concerned with deriving necessary and sufficient optimality conditions for a fuzzy linear programming problem. Toward this end, an equivalence between fuzzy and crisp linear programming problems is established by means of a specific ranking function. Under this setting, a main theorem gives optimality conditions which do not seem to be in conflict with the so-called Karush-Kuhn-Tucker conditions for a crisp linear programming problem.

THE KARUSH-KUHN-TUCKER OPTIMALITY CONDITIONS IN INTERVAL-VALUED MULTIOBJECTIVE PROGRAMMING PROBLEMS

  • Hosseinzade, Elham;Hassanpour, Hassan
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.5_6
    • /
    • pp.1157-1165
    • /
    • 2011
  • The Karush-Kuhn-Tucker (KKT) necessary optimality conditions for nonlinear differentiable programming problems are also sufficient under suitable convexity assumptions. The KKT conditions in multiobjective programming problems with interval-valued objective and constraint functions are derived in this paper. The main contribution of this paper is to obtain the Pareto optimal solutions by resorting to the sufficient optimality condition.

NECESSARY AND SUFFICIENT OPTIMALITY CONDITIONS FOR CONTROL SYSTEMS DESCRIBED BY INTEGRAL EQUATIONS WITH DELAY

  • Elangar, Gamal-N.;Mohammad a Kazemi;Kim, Hoon-Joo
    • Journal of the Korean Mathematical Society
    • /
    • v.37 no.4
    • /
    • pp.625-643
    • /
    • 2000
  • In this paper we formulate an optimal control problem governed by time-delay Volterra integral equations; the problem includes control constraints as well as terminal equality and inequality constraints on the terminal state variables. First, using a special type of state and control variations, we represent a relatively simple and self-contained method for deriving new necessary conditions in the form of Pontryagin minimum principle. We show that these results immediately yield classical Pontryagin necessary conditions for control processes governed by ordinary differential equations (with or without delay). Next, imposing suitable convexity conditions on the functions involved, we derive Mangasarian-type and Arrow-type sufficient optimality conditions.

  • 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.

VECTOR MEASURES APPLIED TO OPTIMAL CONTROL FOR A CLASS OF EVOLUTION EQUATIONS ON BANACH SPACES

  • Ahmed, Nasir Uddin
    • Communications of the Korean Mathematical Society
    • /
    • v.35 no.4
    • /
    • pp.1329-1352
    • /
    • 2020
  • In this paper we consider a class of nonlinear evolution equations on infinite dimensional Banach spaces driven by vector measures. We prove existence and uniqueness of solutions and continuous dependence of solutions on the control measures. Using these results we prove existence of optimal controls for Bolza problems. Based on this result we present necessary conditions of optimality.

INVERSE PROBLEM FOR STOCHASTIC DIFFERENTIAL EQUATIONS ON HILBERT SPACES DRIVEN BY LEVY PROCESSES

  • N. U., Ahmed
    • Nonlinear Functional Analysis and Applications
    • /
    • v.27 no.4
    • /
    • pp.813-837
    • /
    • 2022
  • In this paper we consider inverse problem for a general class of nonlinear stochastic differential equations on Hilbert spaces whose generating operators (drift, diffusion and jump kernels) are unknown. We introduce a class of function spaces and put a suitable topology on such spaces and prove existence of optimal generating operators from these spaces. We present also necessary conditions of optimality including an algorithm and its convergence whereby one can construct the optimal generators (drift, diffusion and jump kernel).

ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS

  • Lee, Gue Myung;Son, Pham Tien
    • Bulletin of the Korean Mathematical Society
    • /
    • v.51 no.1
    • /
    • pp.287-301
    • /
    • 2014
  • In this paper, we prove a necessary optimality theorem for a nonsmooth optimization problem in the face of data uncertainty, which is called a robust optimization problem. Recently, the robust optimization problems have been intensively studied by many authors. Moreover, we give examples showing that the convexity of the uncertain sets and the concavity of the constraint functions are essential in the optimality theorem. We present an example illustrating that our main assumptions in the optimality theorem can be weakened.