AbstractA new approach to a solution of a nonlinear constrained mathematical programming problem involving r-invex functions with respect to the same function η is introduced. An η-approximated problem associated with an original nonlinear mathematical programming problem is presented that involves η-approximated functions constituting the original problem. The equivalence between optima points for the original mathematical programming problem and its η-approximated optimization problem is established under r-invexity assumption
AbstractIn the paper, we introduce and characterize a new class of nonconvex functions in mathematic...
In this paper, we modified a Courant-Beltrami penalty function method for constrained optimization p...
AbstractIn this paper a new class of functions, called η-convex, η-quasiconvex and η-pseudoconvex, a...
AbstractAn η-approximation approach introduced by Antczak [T. Antczak, A new method of solving nonli...
AbstractIn the paper, we introduce and characterize a new class of nonconvex functions in mathematic...
summary:A new approach for obtaining the second order sufficient conditions for nonlinear mathematic...
AbstractInvexity of a function is generalized. The new class of nonconvex functions, called B-(p,r)-...
summary:A new approach for obtaining the second order sufficient conditions for nonlinear mathematic...
AbstractMathematical programming problems involving (p,r)-invex functions with respect to η are cons...
AbstractNotions of invexity of a function and of a set are generalized. The notion of an invex funct...
AbstractMathematical programming problems involving (p,r)-invex functions with respect to η are cons...
AbstractIn nonlinear programming, invexity is sufficient for optimality (in conjunction with the Kuh...
AbstractNotions of invexity of a function and of a set are generalized. The notion of an invex funct...
Nonlinear Programming: Theory and Algorithms?now in an extensively updated Third Edition?addresses t...
AbstractInvexity of a function is generalized. The new class of nonconvex functions, called B-(p,r)-...
AbstractIn the paper, we introduce and characterize a new class of nonconvex functions in mathematic...
In this paper, we modified a Courant-Beltrami penalty function method for constrained optimization p...
AbstractIn this paper a new class of functions, called η-convex, η-quasiconvex and η-pseudoconvex, a...
AbstractAn η-approximation approach introduced by Antczak [T. Antczak, A new method of solving nonli...
AbstractIn the paper, we introduce and characterize a new class of nonconvex functions in mathematic...
summary:A new approach for obtaining the second order sufficient conditions for nonlinear mathematic...
AbstractInvexity of a function is generalized. The new class of nonconvex functions, called B-(p,r)-...
summary:A new approach for obtaining the second order sufficient conditions for nonlinear mathematic...
AbstractMathematical programming problems involving (p,r)-invex functions with respect to η are cons...
AbstractNotions of invexity of a function and of a set are generalized. The notion of an invex funct...
AbstractMathematical programming problems involving (p,r)-invex functions with respect to η are cons...
AbstractIn nonlinear programming, invexity is sufficient for optimality (in conjunction with the Kuh...
AbstractNotions of invexity of a function and of a set are generalized. The notion of an invex funct...
Nonlinear Programming: Theory and Algorithms?now in an extensively updated Third Edition?addresses t...
AbstractInvexity of a function is generalized. The new class of nonconvex functions, called B-(p,r)-...
AbstractIn the paper, we introduce and characterize a new class of nonconvex functions in mathematic...
In this paper, we modified a Courant-Beltrami penalty function method for constrained optimization p...
AbstractIn this paper a new class of functions, called η-convex, η-quasiconvex and η-pseudoconvex, a...