AbstractFor a nonlinear programming problem, under differentiability assumptions, Fritz John suffcient optimality conditions are stated. Also some duality theorems are proved for Mond-Weir type duals. All results are given under generalized convexity assumptions
Abstract In this paper, new classes of generalized (F,α,ρ, d)-V-type I functions are introduced for ...
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with ine...
AbstractIn a recent work, cited in the Introduction, a concept of generalized pseudoconvexity was us...
AbstractFor a nonlinear programming problem, under differentiability assumptions, Fritz John suffcie...
AbstractIn this paper we have obtained Fritz-John type necessary optimality criteria for non-linear ...
AbstractFor a multiobjective nonlinear program which involved inequality and equality constraints, W...
Nondifferentiable quasiconvex programming problems are studied using Clarke's subgradients. Several ...
Nondifferentiable quasiconvex programming problems are studied using Clarke's subgradients. Several ...
AbstractThe concept of efficiency (Pareto optimum) is used to formulate duality for multiobjective n...
Abstract. A multiobjective nonlinear programming problem is con-sidered. Sufficiency theorems are de...
Abstract. Sufficient optimality criteria are derived for a control prob-lem under generalized invexi...
AbstractSeveral sufficiency criteria and duality results are established under generalized ϱ-convexi...
AbstractIn this paper, we establish two theorems of alternative with generalized subconvexlikeness. ...
New classes of generalized (F, ρ)-convexity are introduced for vector-valued functions. Examples are...
Abstract In this paper, we introduce four types of generalized convexity for an n-set function and d...
Abstract In this paper, new classes of generalized (F,α,ρ, d)-V-type I functions are introduced for ...
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with ine...
AbstractIn a recent work, cited in the Introduction, a concept of generalized pseudoconvexity was us...
AbstractFor a nonlinear programming problem, under differentiability assumptions, Fritz John suffcie...
AbstractIn this paper we have obtained Fritz-John type necessary optimality criteria for non-linear ...
AbstractFor a multiobjective nonlinear program which involved inequality and equality constraints, W...
Nondifferentiable quasiconvex programming problems are studied using Clarke's subgradients. Several ...
Nondifferentiable quasiconvex programming problems are studied using Clarke's subgradients. Several ...
AbstractThe concept of efficiency (Pareto optimum) is used to formulate duality for multiobjective n...
Abstract. A multiobjective nonlinear programming problem is con-sidered. Sufficiency theorems are de...
Abstract. Sufficient optimality criteria are derived for a control prob-lem under generalized invexi...
AbstractSeveral sufficiency criteria and duality results are established under generalized ϱ-convexi...
AbstractIn this paper, we establish two theorems of alternative with generalized subconvexlikeness. ...
New classes of generalized (F, ρ)-convexity are introduced for vector-valued functions. Examples are...
Abstract In this paper, we introduce four types of generalized convexity for an n-set function and d...
Abstract In this paper, new classes of generalized (F,α,ρ, d)-V-type I functions are introduced for ...
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with ine...
AbstractIn a recent work, cited in the Introduction, a concept of generalized pseudoconvexity was us...
DOI
Add to ORKG