Fractional semi-infinite programming problems: optimality conditions and duality via tangential subdifferentials
From MaRDI portal
Publication:6616151
Recommendations
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
- Optimality conditions and duality for a class of multiobjective semi-infinite fractional programming
- Nondifferentiable fractional semi-infinite multiobjective optimization problems
- On Minimax Fractional Semi-Infinite Programming Problems with Applications
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- A practical guide to splines
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
- Further Generalizations of Convexity in Mathematical Programming
- Higher-order duality in nondifferentiable minimax programming with generalized type I functions
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Nondifferentiable fractional semi-infinite multiobjective optimization problems
- On Minimax Fractional Semi-Infinite Programming Problems with Applications
- On duality theory for multiobjective semi-infinite fractional optimization model using higher order convexity
- Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity
- Optimality conditions for nonsmooth semi-infinite multiobjective programming
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Robot trajectory planning with semi-infinite programming.
- Robust optimality conditions for semi-infinite equilibrium problems involving data uncertainty
- Selected applications of linear semi-infinite systems theory
- Set-valued analysis
- Sufficient optimality conditions for semi-infinite multiobjective fractional programming under (\(\Phi,\rho\))-\(V\)-invexity and generalized (\(\Phi,\rho\))-\(V\)-invexity
This page was built for publication: Fractional semi-infinite programming problems: optimality conditions and duality via tangential subdifferentials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616151)