On G-invexity-type nonlinear programming problems
نویسندگان
چکیده
منابع مشابه
Generalized Minimax Programming with Nondifferentiable (G, β)-Invexity
We consider the generalized minimax programming problem (P) in which functions are locally Lipschitz (G, β)-invex. Not only G-sufficient but also G-necessary optimality conditions are established for problem (P). With G-necessary optimality conditions and (G, β)-invexity on hand, we construct dual problem (DI) for the primal one (P) and prove duality results between problems (P) and (DI). These...
متن کاملGeneralized Invexity and Duality in Multiobjective Programming Problems
In this paper we consider a multiobjective optimization problem, and we prove Mond-Weir duality results under second-and higher-order conditions of the objective and constraint functions.
متن کاملMultiobjective Variational Programming under Generalized Vector Variational Type I Invexity
Mond-Weir type duals for multiobjective variational problems are formulated. Under generalized vector variational type I invexity assumptions on the functions involved, sufficient optimality conditions, weak and strong duality theorems are proved efficient and properly efficient solutions of the primal and dual problems.
متن کاملOptimality conditions and duality results of the nonlinear programming problems under (p, r)-invexity on differentiable manifolds
The main purpose of this paper is to study a pair of optimization problems on differentiable manifolds under (p, r)-invexity assumptions. By using the (p, r)-invexity assumptions on the functions involved, optimality conditions and duality results (Mond-Weir, Wolfe and mixed type) are established on differentiable manifolds. We construct counterexample to justify that our investigations are mor...
متن کاملCarathéodory–john-type Sufficiency Criteria in Continuous-time Nonlinear Programming under Generalized (α, Ρ)− (η, Θ)-type I Invexity
Continuous-time linear programming was first introduced by Bellman [1] in the treatment of production and inventory “bottleneck” problems. He formulated the dual problem, established a weak duality theorem and described sufficient optimality conditions. Tyndall [12] extended Bellman’s theory and obtained existence and duality theorems for a class of continuous linear programming problem. Levins...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: An International Journal of Optimization and Control: Theories & Applications (IJOCTA)
سال: 2015
ISSN: 2146-5703,2146-0957
DOI: 10.11121/ijocta.01.2015.00202