AbstractIn this paper, we establish necessary optimality conditions for a static minmax programming problem of the form:minmaxy∈Yφ(x,y) subject tog(x)≦0,in terms of the right derivatives of the functions with respect to the same arc. Various theorems giving sufficient optimality conditions are proved. A Mond-Weir type dual is proposed and duality results are established under arcwise connectedness and generalized arcwise connectedness assumptions
Abstract. We establish sufficient optimality conditions for a class of nondif-ferentiable minimax fr...
Necessary and sufficient global optimality conditions are presented for certain non-convex minimizat...
ABSTRACT ' Existence theorems are proved fot basic Problems of Lagrange in the calculus of vari...
AbstractIn this paper, necessary and sufficient optimality conditions are obtained for fractional pr...
Abstract. We derive sufficient optimality conditions for a nonlinear programming prob-lem with inequ...
AbstractIn this paper a class of semi-infinite programming with parametric nonlinear inequality cons...
In the condition that the real valued function f: S → R is a arc connected function in arc connected...
A nonlinear programming problem with mixed constraints is considered, where the functions involved a...
A nonlinear programming problem with inequality constraints is considered, where the functions invol...
AbstractTwo dual problems are proposed for the minimax problem: minimize maxy ϵ Y φ(x, y), subject t...
AbstractA duality theory is derived for minimizing the maximum of a finite set of convex functions s...
AbstractIn this paper we have obtained Fritz-John type necessary optimality criteria for non-linear ...
In this paper arcwise connected convex multifunctions are introduced and studied. Optimality condit...
We consider the generalized minimax programming problem (P) in which functions are locally Lipschitz...
AbstractOptimality conditions are proved for a class of generalized fractional minimax programming p...
Abstract. We establish sufficient optimality conditions for a class of nondif-ferentiable minimax fr...
Necessary and sufficient global optimality conditions are presented for certain non-convex minimizat...
ABSTRACT ' Existence theorems are proved fot basic Problems of Lagrange in the calculus of vari...
AbstractIn this paper, necessary and sufficient optimality conditions are obtained for fractional pr...
Abstract. We derive sufficient optimality conditions for a nonlinear programming prob-lem with inequ...
AbstractIn this paper a class of semi-infinite programming with parametric nonlinear inequality cons...
In the condition that the real valued function f: S → R is a arc connected function in arc connected...
A nonlinear programming problem with mixed constraints is considered, where the functions involved a...
A nonlinear programming problem with inequality constraints is considered, where the functions invol...
AbstractTwo dual problems are proposed for the minimax problem: minimize maxy ϵ Y φ(x, y), subject t...
AbstractA duality theory is derived for minimizing the maximum of a finite set of convex functions s...
AbstractIn this paper we have obtained Fritz-John type necessary optimality criteria for non-linear ...
In this paper arcwise connected convex multifunctions are introduced and studied. Optimality condit...
We consider the generalized minimax programming problem (P) in which functions are locally Lipschitz...
AbstractOptimality conditions are proved for a class of generalized fractional minimax programming p...
Abstract. We establish sufficient optimality conditions for a class of nondif-ferentiable minimax fr...
Necessary and sufficient global optimality conditions are presented for certain non-convex minimizat...
ABSTRACT ' Existence theorems are proved fot basic Problems of Lagrange in the calculus of vari...