To relax convexity assumptions imposed on the functions in theorems on sufficient conditions and duality,new concepts of generalized dI-G-type Ⅰ invexity were introduced for nondifferentiable multiobjective programmi...To relax convexity assumptions imposed on the functions in theorems on sufficient conditions and duality,new concepts of generalized dI-G-type Ⅰ invexity were introduced for nondifferentiable multiobjective programming problems.Based upon these generalized invexity,G-Fritz-John （G-F-J） and G-Karnsh-Kuhn-Tucker （G-K-K-T） types sufficient optimality conditions were established for a feasible solution to be an efficient solution.Moreover,weak and strict duality results were derived for a G-Mond-Weir type dual under various types of generalized dI-G-type Ⅰ invexity assumptions.展开更多
This paper introduces some new generalizations of the concept of （~, p）-invexity for non- differentiable locally Lipschitz functions using the tools of Clarke subdifferential. These functions are used to derive the ...This paper introduces some new generalizations of the concept of （~, p）-invexity for non- differentiable locally Lipschitz functions using the tools of Clarke subdifferential. These functions are used to derive the necessary and sufficient optimality conditions for a class of nonsmooth semi-infinite minmax programming problems, where set of restrictions are indexed in a compact set. Utilizing the sufficient optimality conditions, the authors formulate three types of dual models and establish weak and strong duality results. The results of the paper extend and unify naturally some earlier results from the literature.展开更多
A Mond-Weir type second-order dual continuous programming problem associated with a class of nondifferentiable continuous programming problems is formulated. Under second-order pseudo-invexity and second-order quasi-i...A Mond-Weir type second-order dual continuous programming problem associated with a class of nondifferentiable continuous programming problems is formulated. Under second-order pseudo-invexity and second-order quasi-invexity various duality theorems are established for this pair of dual continuous programming problems. A pair of dual continuous programming problems with natural boundary values is constructed and the proofs of its various duality results are briefly outlined. Further, it is shown that our results can be regarded as dynamic generalizations of corresponding (static) second-order duality theorems for a class of nondifferentiable nonlinear programming problems already studied in the literature.展开更多
A dual for a nonlinear programming problem in the presence of equality and inequality constraints which represent many realistic situation, is formulated which uses Fritz John optimality conditions instead of the Karu...A dual for a nonlinear programming problem in the presence of equality and inequality constraints which represent many realistic situation, is formulated which uses Fritz John optimality conditions instead of the Karush-Kuhn-Tucker optimality conditions and does not require a constraint qualification. Various duality results, namely, weak, strong, strict-converse and converse duality theorems are established under suitable generalized convexity. A generalized Fritz John type dual to the problem is also formulated and usual duality results are proved. In essence, the duality results do not require any regularity condition if the formulations of dual problems uses Fritz John optimality conditions.展开更多
Fritz John and Karush-Kuhn-Tucker type optimality conditions for a nondifferentiable multiobjective variational problem are derived. As an application of Karush-Kuhn-Tucker type optimality conditions, Mond-weir type s...Fritz John and Karush-Kuhn-Tucker type optimality conditions for a nondifferentiable multiobjective variational problem are derived. As an application of Karush-Kuhn-Tucker type optimality conditions, Mond-weir type second-order nondifferentiable multiobjective dual variational problems is constructed. Various duality results for the pair of Mond-Weir type second-order dual variational problems are proved under second-order pseudoinvexity and second-order quasi-invexity. A pair of Mond-Weir type dual variational problems with natural boundary values is formulated to derive various duality results. Finally, it is pointed out that our results can be considered as dynamic generalizations of their static counterparts existing in the literature.展开更多
A second-order dual problem is formulated for a class of continuous programming problem in which both objective and constrained functions contain support functions, hence it is nondifferentiable. Under second-order in...A second-order dual problem is formulated for a class of continuous programming problem in which both objective and constrained functions contain support functions, hence it is nondifferentiable. Under second-order invexity and second-order pseudoinvexity, weak, strong and converse duality theorems are established for this pair of dual problems. Special cases are deduced and a pair of dual continuous problems with natural boundary values is constructed. A close relationship between duality results of our problems and those of the corresponding (static) nonlinear programming problem with support functions is briefly outlined.展开更多
In this article, we focus to study about modified objective function approach for multiobjective optimization problem with vanishing constraints. An equivalent η-approximated multiobjective optimization problem is co...In this article, we focus to study about modified objective function approach for multiobjective optimization problem with vanishing constraints. An equivalent η-approximated multiobjective optimization problem is constructed by a modification of the objective function in the original considered optimization problem. Furthermore, we discuss saddle point criteria for the aforesaid problem. Moreover, we present some examples to verify the established results.展开更多
A second-order Mond-Weir type dual problem is formulated for a class of continuous programming problems in which both objective and constraint functions contain support functions;hence it is nondifferentiable. Under s...A second-order Mond-Weir type dual problem is formulated for a class of continuous programming problems in which both objective and constraint functions contain support functions;hence it is nondifferentiable. Under second-order strict pseudoinvexity, second-order pseudoinvexity and second-order quasi-invexity assumptions on functionals, weak, strong, strict converse and converse duality theorems are established for this pair of dual continuous programming problems. Special cases are deduced and a pair of dual continuous problems with natural boundary values is constructed. A close relationship between the duality results of our problems and those of the corresponding (static) nonlinear programming problem with support functions is briefly outlined.展开更多
In this article, for a differentiable function , we introduce the definition of the higher-order -invexity. Three duality models for a multiobjective fractional programming problem involving nondifferentiability in te...In this article, for a differentiable function , we introduce the definition of the higher-order -invexity. Three duality models for a multiobjective fractional programming problem involving nondifferentiability in terms of support functions have been formulated and usual duality relations have been established under the higher-order -invex assumptions.展开更多
In this paper, we derive optimality conditions for a nondifferentiable multiobjective programming problem containing a certain square root of a quadratic form in each component of the objective function in the presenc...In this paper, we derive optimality conditions for a nondifferentiable multiobjective programming problem containing a certain square root of a quadratic form in each component of the objective function in the presence of equality and inequality constraints. As an application of Karush-Kuhn-Tucker type optimality conditions, a Mond-Weir type dual to this problem is formulated and various duality results are established under generalized invexity assumptions. Finally, a special case is deduced from our result.展开更多
The D-η-proper prequasi invexity of vector-valued functions is characterized by means of （weak） nearly convexity and density of sets. Under weaker assumptions, some equivalent conditions for D-η-proper prequasi-in...The D-η-proper prequasi invexity of vector-valued functions is characterized by means of （weak） nearly convexity and density of sets. Under weaker assumptions, some equivalent conditions for D-η-proper prequasi-invexity are derived.展开更多
The exact minimax penalty function method is used to solve a noncon- vex differentiable optimization problem with both inequality and equality constraints. The conditions for exactness of the penalization for the exac...The exact minimax penalty function method is used to solve a noncon- vex differentiable optimization problem with both inequality and equality constraints. The conditions for exactness of the penalization for the exact minimax penalty function method are established by assuming that the functions constituting the considered con- strained optimization problem are invex with respect to the same function η （with the exception of those equality constraints for which the associated Lagrange multipliers are negative these functions should be assumed to be incave with respect to η）. Thus, a threshold of the penalty parameter is given such that, for all penalty parameters exceeding this threshold, equivalence holds between the set of optimal solutions in the considered constrained optimization problem and the set of minimizer in its associated penalized problem with an exact minimax penalty function. It is shown that coercivity is not suf- ficient to prove the results.展开更多
基金National Natural Science Foundation of China(No.11071110)
文摘To relax convexity assumptions imposed on the functions in theorems on sufficient conditions and duality,new concepts of generalized dI-G-type Ⅰ invexity were introduced for nondifferentiable multiobjective programming problems.Based upon these generalized invexity,G-Fritz-John （G-F-J） and G-Karnsh-Kuhn-Tucker （G-K-K-T） types sufficient optimality conditions were established for a feasible solution to be an efficient solution.Moreover,weak and strict duality results were derived for a G-Mond-Weir type dual under various types of generalized dI-G-type Ⅰ invexity assumptions.
基金supported by the National Board of Higher Mathematics(NBHM)Department of Atomic Energy,India,under Grant No.2/40(12)/2014/R&D-II/10054
文摘This paper introduces some new generalizations of the concept of （~, p）-invexity for non- differentiable locally Lipschitz functions using the tools of Clarke subdifferential. These functions are used to derive the necessary and sufficient optimality conditions for a class of nonsmooth semi-infinite minmax programming problems, where set of restrictions are indexed in a compact set. Utilizing the sufficient optimality conditions, the authors formulate three types of dual models and establish weak and strong duality results. The results of the paper extend and unify naturally some earlier results from the literature.
文摘A Mond-Weir type second-order dual continuous programming problem associated with a class of nondifferentiable continuous programming problems is formulated. Under second-order pseudo-invexity and second-order quasi-invexity various duality theorems are established for this pair of dual continuous programming problems. A pair of dual continuous programming problems with natural boundary values is constructed and the proofs of its various duality results are briefly outlined. Further, it is shown that our results can be regarded as dynamic generalizations of corresponding (static) second-order duality theorems for a class of nondifferentiable nonlinear programming problems already studied in the literature.
文摘A dual for a nonlinear programming problem in the presence of equality and inequality constraints which represent many realistic situation, is formulated which uses Fritz John optimality conditions instead of the Karush-Kuhn-Tucker optimality conditions and does not require a constraint qualification. Various duality results, namely, weak, strong, strict-converse and converse duality theorems are established under suitable generalized convexity. A generalized Fritz John type dual to the problem is also formulated and usual duality results are proved. In essence, the duality results do not require any regularity condition if the formulations of dual problems uses Fritz John optimality conditions.
文摘Fritz John and Karush-Kuhn-Tucker type optimality conditions for a nondifferentiable multiobjective variational problem are derived. As an application of Karush-Kuhn-Tucker type optimality conditions, Mond-weir type second-order nondifferentiable multiobjective dual variational problems is constructed. Various duality results for the pair of Mond-Weir type second-order dual variational problems are proved under second-order pseudoinvexity and second-order quasi-invexity. A pair of Mond-Weir type dual variational problems with natural boundary values is formulated to derive various duality results. Finally, it is pointed out that our results can be considered as dynamic generalizations of their static counterparts existing in the literature.
文摘A second-order dual problem is formulated for a class of continuous programming problem in which both objective and constrained functions contain support functions, hence it is nondifferentiable. Under second-order invexity and second-order pseudoinvexity, weak, strong and converse duality theorems are established for this pair of dual problems. Special cases are deduced and a pair of dual continuous problems with natural boundary values is constructed. A close relationship between duality results of our problems and those of the corresponding (static) nonlinear programming problem with support functions is briefly outlined.
基金financially supported by the CSIR,New Delhi,India through Grant no.:25(0266)/17/EMR-II
文摘In this article, we focus to study about modified objective function approach for multiobjective optimization problem with vanishing constraints. An equivalent η-approximated multiobjective optimization problem is constructed by a modification of the objective function in the original considered optimization problem. Furthermore, we discuss saddle point criteria for the aforesaid problem. Moreover, we present some examples to verify the established results.
文摘A second-order Mond-Weir type dual problem is formulated for a class of continuous programming problems in which both objective and constraint functions contain support functions;hence it is nondifferentiable. Under second-order strict pseudoinvexity, second-order pseudoinvexity and second-order quasi-invexity assumptions on functionals, weak, strong, strict converse and converse duality theorems are established for this pair of dual continuous programming problems. Special cases are deduced and a pair of dual continuous problems with natural boundary values is constructed. A close relationship between the duality results of our problems and those of the corresponding (static) nonlinear programming problem with support functions is briefly outlined.
文摘In this article, for a differentiable function , we introduce the definition of the higher-order -invexity. Three duality models for a multiobjective fractional programming problem involving nondifferentiability in terms of support functions have been formulated and usual duality relations have been established under the higher-order -invex assumptions.
文摘In this paper, we derive optimality conditions for a nondifferentiable multiobjective programming problem containing a certain square root of a quadratic form in each component of the objective function in the presence of equality and inequality constraints. As an application of Karush-Kuhn-Tucker type optimality conditions, a Mond-Weir type dual to this problem is formulated and various duality results are established under generalized invexity assumptions. Finally, a special case is deduced from our result.
文摘The D-η-proper prequasi invexity of vector-valued functions is characterized by means of （weak） nearly convexity and density of sets. Under weaker assumptions, some equivalent conditions for D-η-proper prequasi-invexity are derived.
文摘The exact minimax penalty function method is used to solve a noncon- vex differentiable optimization problem with both inequality and equality constraints. The conditions for exactness of the penalization for the exact minimax penalty function method are established by assuming that the functions constituting the considered con- strained optimization problem are invex with respect to the same function η （with the exception of those equality constraints for which the associated Lagrange multipliers are negative these functions should be assumed to be incave with respect to η）. Thus, a threshold of the penalty parameter is given such that, for all penalty parameters exceeding this threshold, equivalence holds between the set of optimal solutions in the considered constrained optimization problem and the set of minimizer in its associated penalized problem with an exact minimax penalty function. It is shown that coercivity is not suf- ficient to prove the results.
