Multiobjective programming under generalized type I invexity
From MaRDI portal
Publication:5949584
DOI10.1006/jmaa.2001.7542zbMath0983.90057OpenAlexW2090364513MaRDI QIDQ5949584
Morgan A. Hanson, Chanchal Singh, Rita Pini
Publication date: 21 November 2001
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.2001.7542
multiobjective programmingconverse duality theoremsgeneralized type-I invexityLagrange multiplier conditionsstrong dualityvector invexityweak duality
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Related Items (27)
Some nondifferentiable multiobjective programming problems ⋮ Nonsmooth multiobjective optimization involving generalized univex functions ⋮ Generalized \(\alpha\)-invexity and nondifferentiable minimax fractional programming ⋮ Optimality conditions for multiple objective fractional subset programming with \(({\mathcal F},\alpha,\rho,\theta)\)-V-type-I and related non-convex functions ⋮ A characterization of pseudoinvexity in multiobjective programming ⋮ Duality for multiple objective fractional subset programming with generalized \((\Gamma\mkern-15mu-,\rho,\sigma,\theta)\)-V-Type-I functions ⋮ Higher-order duality results for a new class of nonconvex nonsmooth multiobjective programming problems ⋮ Multiple-objective programs in Banach spaces: sufficiency for (proper) optimality ⋮ Optimality and duality in nonsmooth multiobjective optimization involving V-type I invex functions ⋮ New optimality conditions for nonsmooth control problems ⋮ Optimality conditions and duality for \(E\)-differentiable multiobjective programming involving \(V\)-\(E\)-type I functions ⋮ Nondifferentiable minimax fractional programming under generalized univexity ⋮ Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions ⋮ Infine functions and nonsmooth multiobjective optimization problems ⋮ Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions ⋮ Sufficiency and duality in multiobjective programming under generalized type I functions ⋮ Optimality and duality for multiple-objective optimization under generalized type I univexity ⋮ Generalized type I invexity and duality in multiobjective variational problems ⋮ Sufficiency and duality in multiobjective fractional programming problems involving generalized type I functions ⋮ Generalized V-univexity type-I for multiobjective programming with \(n\)-set functions ⋮ Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems ⋮ Generalized \(\alpha \)-univexity and duality for nondifferentiable minimax fractional programming ⋮ Multiobjective Problems with Nonsmooth Equality Constraints ⋮ Some nondifferentiable multiobjective programming under generalized d-V-type-I univexity ⋮ Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity ⋮ Duality models for multiobjective semiinfinite fractional programming problems involving type-I and related functions ⋮ Multiobjective programming under \((\varphi,d)\)-V-type I univexity
Cites Work
- Unnamed Item
- On sufficiency of the Kuhn-Tucker conditions
- Second-order efficiency conditions and sensitivity of efficient points
- Benson proper efficiency in the vector optimization of set-valued maps
- Invex functions and generalized convexity in multiobjective programming
- A fuzzy multiobjective linear programming
- Second-order optimality conditions in multiobjective optimization problems
- On the monotonicity of the compromise set in multicriteria problems
- Regularity conditions in vector optimization
- Optimality criteria and duality in multiple-objective optimization involving generalized invexity
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Multiobjective programming with semilocally convex functions
- Optimality conditions for Pareto nonsmooth nonconvex programming in Banach spaces
- Proper efficiency and the theory of vector maximization
- Necessary and sufficient conditions in constrained optimization
- A duality theorem for non-linear programming
- Invex functions and constrained local minima
- Second-order necessary and sufficient conditions in multiobjective programming∗
- On generalised convex mathematical programming
- Lagrange multiplers for pareto nonsmooth programming problems in banach spaces
- A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions]
- Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
- On generalised convex multi-objective nonsmooth programming
- Equivalence in nonlinear programming
This page was built for publication: Multiobjective programming under generalized type I invexity
