New optimality conditions for a nondifferentiable fractional semipreinvex programming problem
Summary: We study a nondifferentiable fractional programming problem as follows: \((P)\min_{x \in K}f(x)/g(x)\) subject to \(x \in K \subseteq X\), \(h_i(x) \leq 0\), \(i = 1, 2, \dots, m\), where \(K\) is a semiconnected subset in a locally convex topological vector space \(X\), \(f : K \to \mathbb R\), \(g : K \to \mathbb R_+\) and \(h_i : K \to \mathbb R\), \(i = 1, 2, \dots, m\). If \(f\), \(-g\), and \(h_i\), \(i = 1, 2, \dots, m\), are arc-directionally differentiable, semipreinvex maps with respect to a continuous map \(\gamma : [0, 1] \to K \subseteq X\) satisfying \(\gamma(0) = 0\) and \(\gamma'(O^+) \in K\), then the necessary and sufficient conditions for optimality of \((P)\) are established.
- Nonconvex Nonsmooth Minimax Fractional Programming Involving Generalized Semidifferentiable Preinvex Functions with Different Directions
- scientific article; zbMATH DE number 1958490
- Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions.
- Optimality conditions and duality in fractional programming involving semilocally preinvex and related functions
- Nondifferentiable minimax fractional programming problem with nonsmooth generalized convex functions
- \((p,r)\)-invex sets and functions
- \(D\)-invexity and optimality conditions
- A class of nonconvex functions and mathematical programming
- Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
- Duality theorem of nondifferentiable convex multiobjective programming
- Generalized convexity and vector optimization
- scientific article; zbMATH DE number 3902413 (Why is no real title available?)
- scientific article; zbMATH DE number 1941907 (Why is no real title available?)
- Invex functions and constrained local minima
- Invexity and optimization
- Minimax fractional programming involving generalised invex functions
- Moreau-Rockafellar type theorem for convex set functions
- Necessary and sufficient conditions in constrained optimization
- Nonsmooth invexity
- Nonsmooth minimax fractional programming involving {\(\eta\)}-pseudolinear functions
- On V-r-invexity and vector variational-like inequalities
- On approximately star-shaped functions and approximate vector variational inequalities
- On sufficiency of the Kuhn-Tucker conditions
- On the convexification procedure for nonconvex and nonsmooth infinite dimensional optimization problems
- Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming
- Optimality conditions for semi-preinvex programming
- Optimality criteria in mathematical programming involving generalized invexity
- Optimization and nonsmooth analysis
- Programming with semilocally convex functions
- V-invex functions and vector optimization.
This page was built for publication: New optimality conditions for a nondifferentiable fractional semipreinvex programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375573)