Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity
From MaRDI portal
Publication:2341603
DOI10.1007/s11424-015-2233-2zbMath1310.90115OpenAlexW1970372305MaRDI QIDQ2341603
Hoai An Le Thi, Monika Jaiswal, Shashi Kant Mishra
Publication date: 27 April 2015
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-015-2233-2
Related Items (2)
Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials ⋮ Optimality and duality for multiobjective semi-infinite variational problem using higher-order B-type I functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality for nonsmooth semi-infinite programming problems
- Sufficiency in nonsmooth multiobjective programming involving generalized \(( F, \rho\) )-convexity
- Semi-infinite programming
- Generalized semi-infinite programming: On generic local minimizers
- On efficiency and duality for multiobjective programs
- A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- A smoothing Newton method for semi-infinite programming
- Generalized \((F,\rho )\)-convexity and duality in nonsmooth problems of multiobjective optimization
- Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity
- A homotopy interior point method for semi-infinite programming problems
- Generalized convexities and generalized gradients based on algebraic operations
- Optimality conditions for non-smooth semi-infinite programming
- Strong and Weak Convexity of Sets and Functions
- Variational Analysis in Semi-Infinite and Infinite Programming, II: Necessary Optimality Conditions
- Semi-Infinite Programming: Theory, Methods, and Applications
- Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
- Semi-infinite programming, duality, discretization and optimality conditions†
- Optimization and nonsmooth analysis
- Further Generalizations of Convexity in Mathematical Programming
- Nonsmooth minimax fractional programming involvingη-pseudolinear functions
- Semi-infinite programming. Recent advances
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
This page was built for publication: Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity
