To relax convexity assumptions imposed on the functions in theorems on sufficient conditions and duality,new concepts of generalized d I-G-type I 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 d I-G-type I invexity were introduced for nondifferentiable multiobjective programming problems.Based upon these generalized invexity,G-Fritz-John(G-F-J)and G-KarushKuhn-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 GMond-Weir type dual under various types of generalized d I-G-type I invexity assumptions.展开更多
A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research t...A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research topics in mathematical programming. In this paper, we discuss a fairly large number of paramet- ric duality results under various generalized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programming problem.展开更多
In this paper, we discuss a large number of sets of global parametric sufficient optimality conditions under various generalized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programming problem.
In this paper, we present several parametric duality results under various generalized (a,v,p)-V- invexity assumptions for a semiinfinite multiobjective fractional programming problem.
Abstract In this paper, we discuss numerous sets of global parametric sufficient efficiency conditions under various generalized (a,n, p)-V-invexity assumptions for a semiinfinite multiobjective fractional programmi...Abstract In this paper, we discuss numerous sets of global parametric sufficient efficiency conditions under various generalized (a,n, p)-V-invexity assumptions for a semiinfinite multiobjective fractional programming problem.展开更多
In this paper,we consider semi-infinite mathematical programming problems with equilibrium constraints(SIMPPEC).By using the notion of convexificators,we establish sufficient optimality conditions for the SIMPPEC.We f...In this paper,we consider semi-infinite mathematical programming problems with equilibrium constraints(SIMPPEC).By using the notion of convexificators,we establish sufficient optimality conditions for the SIMPPEC.We formulate Wolfe and Mond–Weir-type dual models for the SIMPPEC under the invexity and generalized invexity assumptions.Weak and strong duality theorems are established to relate the SIMPPEC and two dual programs in the framework of convexificators.展开更多
In this paper,we explore a class of interval-valued programming problem where constraints are interval-valued and infinite.Necessary optimality conditions are derived.Notion of generalized(Φ,ρ)−invexity is utilized ...In this paper,we explore a class of interval-valued programming problem where constraints are interval-valued and infinite.Necessary optimality conditions are derived.Notion of generalized(Φ,ρ)−invexity is utilized to establish sufficient optimality conditions.Further,two duals,namely Wolfe and Mond–Weir,are proposed for which duality results are proved.展开更多
In this paper,a new mixed-type higher-order symmetric duality in scalar-objective programming is formulated.In the literature we have results either Wolfe or Mond–Weir-type dual or separately,while in this we have co...In this paper,a new mixed-type higher-order symmetric duality in scalar-objective programming is formulated.In the literature we have results either Wolfe or Mond–Weir-type dual or separately,while in this we have combined those results over one model.The weak,strong and converse duality theorems are proved for these programs underη-invexity/η-pseudoinvexity assumptions.Self-duality is also discussed.Our results generalize some existing dual formulations which were discussed by Agarwal et al.(Generalized second-order mixed symmetric duality in nondifferentiable mathematical programming.Abstr.Appl.Anal.2011.https://doi.org/10.1155/2011/103597),Chen(Higher-order symmetric duality in nonlinear nondifferentiable programs),Gulati and Gupta(Wolfe type second order symmetric duality in nondifferentiable programming.J.Math.Anal.Appl.310,247–253,2005,Higher order nondifferentiable symmetric duality with generalized F-convexity.J.Math.Anal.Appl.329,229–237,2007),Gulati and Verma(Nondifferentiable higher order symmetric duality under invexity/generalized invexity.Filomat 28(8),1661–1674,2014),Hou andYang(On second-order symmetric duality in nondifferentiable programming.J Math Anal Appl.255,488–491,2001),Verma and Gulati(Higher order symmetric duality using generalized invexity.In:Proceeding of 3rd International Conference on Operations Research and Statistics(ORS).2013.https://doi.org/10.5176/2251-1938_ORS13.16,Wolfe type higher order symmetric duality under invexity.J Appl Math Inform.32,153–159,2014).展开更多
基金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 d I-G-type I invexity were introduced for nondifferentiable multiobjective programming problems.Based upon these generalized invexity,G-Fritz-John(G-F-J)and G-KarushKuhn-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 GMond-Weir type dual under various types of generalized d I-G-type I invexity assumptions.
文摘A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research topics in mathematical programming. In this paper, we discuss a fairly large number of paramet- ric duality results under various generalized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programming problem.
文摘In this paper, we discuss a large number of sets of global parametric sufficient optimality conditions under various generalized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programming problem.
文摘In this paper, we present several parametric duality results under various generalized (a,v,p)-V- invexity assumptions for a semiinfinite multiobjective fractional programming problem.
文摘Abstract In this paper, we discuss numerous sets of global parametric sufficient efficiency conditions under various generalized (a,n, p)-V-invexity assumptions for a semiinfinite multiobjective fractional programming problem.
基金The research of Shashi Kant Mishra was supported by Department of Science and Technology-Science and Engineering Research Board(No.MTR/2018/000121),India.
文摘In this paper,we consider semi-infinite mathematical programming problems with equilibrium constraints(SIMPPEC).By using the notion of convexificators,we establish sufficient optimality conditions for the SIMPPEC.We formulate Wolfe and Mond–Weir-type dual models for the SIMPPEC under the invexity and generalized invexity assumptions.Weak and strong duality theorems are established to relate the SIMPPEC and two dual programs in the framework of convexificators.
基金Bharti Sharma was supported by Council of Scientific and Industrial Research,Senior Research Fellowship,India(No.09/045(1350)/2014-EMR-1)Jyoti Dagar was supported by University Grant Commission Non-NET research fellowship,India(No.Non-NET/139/Ext-136/2014).
文摘In this paper,we explore a class of interval-valued programming problem where constraints are interval-valued and infinite.Necessary optimality conditions are derived.Notion of generalized(Φ,ρ)−invexity is utilized to establish sufficient optimality conditions.Further,two duals,namely Wolfe and Mond–Weir,are proposed for which duality results are proved.
基金The research of Khushboo Verma was supported by the Department of Atomic Energy,Govt.of India,the NBHM Post-Doctoral Fellowship Program(No.2/40(31)/2015/RD-II/9474).
文摘In this paper,a new mixed-type higher-order symmetric duality in scalar-objective programming is formulated.In the literature we have results either Wolfe or Mond–Weir-type dual or separately,while in this we have combined those results over one model.The weak,strong and converse duality theorems are proved for these programs underη-invexity/η-pseudoinvexity assumptions.Self-duality is also discussed.Our results generalize some existing dual formulations which were discussed by Agarwal et al.(Generalized second-order mixed symmetric duality in nondifferentiable mathematical programming.Abstr.Appl.Anal.2011.https://doi.org/10.1155/2011/103597),Chen(Higher-order symmetric duality in nonlinear nondifferentiable programs),Gulati and Gupta(Wolfe type second order symmetric duality in nondifferentiable programming.J.Math.Anal.Appl.310,247–253,2005,Higher order nondifferentiable symmetric duality with generalized F-convexity.J.Math.Anal.Appl.329,229–237,2007),Gulati and Verma(Nondifferentiable higher order symmetric duality under invexity/generalized invexity.Filomat 28(8),1661–1674,2014),Hou andYang(On second-order symmetric duality in nondifferentiable programming.J Math Anal Appl.255,488–491,2001),Verma and Gulati(Higher order symmetric duality using generalized invexity.In:Proceeding of 3rd International Conference on Operations Research and Statistics(ORS).2013.https://doi.org/10.5176/2251-1938_ORS13.16,Wolfe type higher order symmetric duality under invexity.J Appl Math Inform.32,153–159,2014).