Semi-infinite multiobjective programming with generalized invexity
From MaRDI portal
Recommendations
- On semi-infinite minmax programming with generalized invexity
- Multi-objective infinite programming
- Multiobjective programming under generalized type I invexity
- scientific article; zbMATH DE number 7009380
- On sufficiency and duality for semi-infinite multiobjective optimisation problems involving V-invexity
Cited in
(27)- Optimality conditions for nondifferentiable multiobjective semi-infinite programming problems
- Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential
- On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints
- Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
- Multi-objective semi-infinite variational problem and generalized invexity
- Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
- Multiobjective DC programs with infinite convex constraints
- Nonsmooth semi-infinite multiobjective optimization problems
- Higher-order duality for multiobjective programming problem involving \((\Phi, \rho)\)-invex functions
- Optimality conditions in convex multiobjective SIP
- Second order \((\Phi, \rho)\)-\(V\)-invexity and duality for semi-infinite minimax fractional programming
- Optimality conditions for nonsmooth semi-infinite multiobjective programming
- Multi-objective infinite programming
- An \({\mathcal{UV}}\)-algorithm for semi-infinite multiobjective programming
- On nondifferentiable semi-infinite multiobjective programming with interval-valued functions
- On semi-infinite minmax programming with generalized invexity
- Constraint qualifications in convex vector semi-infinite optimization
- Optimality conditions for strict minimizers of higher-order in semi-infinite multi-objective optimization
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions
- scientific article; zbMATH DE number 7514032 (Why is no real title available?)
- scientific article; zbMATH DE number 7400725 (Why is no real title available?)
- HIGHER ORDER DUALITY FOR A NEW CLASS OF NONCONVEX SEMI-INFINITE MULTIOBJECTIVE FRACTIONAL PROGRAMMING WITH SUPPORT FUNCTIONS
- \(\varPhi\)-weak Slater constraint qualification in nonsmooth multiobjective semi-infinite programming
- First-order optimality conditions for Lipschitz optimization problems with vanishing constraints
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
This page was built for publication: Semi-infinite multiobjective programming with generalized invexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5392243)
