A Fritz John type dual for a nondifferentiable continuous programming problem with equality and inequality constraints which represent many realistic situations is formulated using Fritz John type optimality conditions instead of Karush-Kuhn-Tucker type conditions and thus does not require a regularity condition. Various duality results under suitable generalized convexity assumptions are derived. A pair of Fritz John type dual continuous programming with natural boundary conditions rather than fixed end points is also presented. Finally, it is pointed that our duality results can be considered as dynamic generalizations of those of a nondifferentiable nonlinear programming problem in the presence of equality and inequality constraints rece...
AbstractFirst-order stationary-point necessary optimality criteria of both the Fritz John and Kuhn-T...
In this paper, we use the concept of convexificators to derive enhanced Fritz John optimality condit...
AbstractTwo dual problems are proposed for the minimax problem: minimize maxy ϵ Y φ(x, y), subject t...
Abstract: A Fritz John type dual for a nondifferentiable continuous pro-gramming problem with equali...
AbstractIn this paper we have obtained Fritz-John type necessary optimality criteria for non-linear ...
In this paper we analyse the Fritz John and Karush-Kuhn-Tucker conditions for a (Gateaux) differe...
AbstractA second-order dual to a nonlinear programming problem is formulated. This dual uses the Fri...
AbstractOptimality conditions, duality and converse duality results are obtained for a class of cont...
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with ine...
In this note we give an elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions for non...
AbstractUsing a minmax approach, we establish saddle point optimality conditions and Lagrangian dual...
We consider convex constrained optimization problems, and we enhance the classical Fritz John optima...
AbstractThe concept of invexity has allowed the convexity requirements in a variety of mathematical ...
AbstractIn this paper, new classes of nondifferentiable functions constituting multiobjective progra...
AbstractCraven [1] established the weak duality and the strong duality for a nonlinear fractional pr...
AbstractFirst-order stationary-point necessary optimality criteria of both the Fritz John and Kuhn-T...
In this paper, we use the concept of convexificators to derive enhanced Fritz John optimality condit...
AbstractTwo dual problems are proposed for the minimax problem: minimize maxy ϵ Y φ(x, y), subject t...
Abstract: A Fritz John type dual for a nondifferentiable continuous pro-gramming problem with equali...
AbstractIn this paper we have obtained Fritz-John type necessary optimality criteria for non-linear ...
In this paper we analyse the Fritz John and Karush-Kuhn-Tucker conditions for a (Gateaux) differe...
AbstractA second-order dual to a nonlinear programming problem is formulated. This dual uses the Fri...
AbstractOptimality conditions, duality and converse duality results are obtained for a class of cont...
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with ine...
In this note we give an elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions for non...
AbstractUsing a minmax approach, we establish saddle point optimality conditions and Lagrangian dual...
We consider convex constrained optimization problems, and we enhance the classical Fritz John optima...
AbstractThe concept of invexity has allowed the convexity requirements in a variety of mathematical ...
AbstractIn this paper, new classes of nondifferentiable functions constituting multiobjective progra...
AbstractCraven [1] established the weak duality and the strong duality for a nonlinear fractional pr...
AbstractFirst-order stationary-point necessary optimality criteria of both the Fritz John and Kuhn-T...
In this paper, we use the concept of convexificators to derive enhanced Fritz John optimality condit...
AbstractTwo dual problems are proposed for the minimax problem: minimize maxy ϵ Y φ(x, y), subject t...