Generalized (,)-invex functions and global semiparametric sufficient efficiency conditions for multiobjective fractional programming problems containing arbitrary norms
DOI10.1007/S10898-006-6586-XzbMATH Open1131.90056OpenAlexW2044062730MaRDI QIDQ857795FDOQ857795
Publication date: 5 January 2007
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-6586-x
Recommendations
- Generalized \((\eta,\rho)\)-invex functions and semiparametric duality models for multiobjective fractional programming problems containing arbitrary norms
- Global semiparametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha, \eta,\rho)\)-V-invex functions
- Generalized \((\eta,\rho)\)-invex functions and global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing arbitrary norms
- Semiinfinite multiobjective fractional programming. I: Sufficient efficiency conditions
- The \(\epsilon\)-efficiency conditions for multiobjective fractional programming problems
multiobjective fractional programmingarbitrary normsgeneralized \((\eta,\rho)\)-invex functionssufficient efficiency conditions
Multi-objective and goal programming (90C29) Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)
Cites Work
- Matrix Analysis
- Theory of multiobjective optimization
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Nonlinear multiobjective optimization
- On sufficiency of the Kuhn-Tucker conditions
- Invexity at a point: generalisations and classification
- Title not available (Why is that?)
- Nonsmooth invexity
- What is invexity?
- Invex functions and constrained local minima
- Further Generalizations of Convexity in Mathematical Programming
- Proper efficiency principles and duality models for a class of continuous-time multiobjective fractional programming problems with operator constraints
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- Various types of nonsmooth invex functions
- The essence of invexity
- Generalized convex duality for multiobjective fractional programs
- Invexity and generalized convexity
- Title not available (Why is that?)
- On generalized convex functions in optimization theory -- a survey
- Title not available (Why is that?)
- Continuous-time multiobjective fractional programming
- Proper efficiency conditions and duality models for nonsmooth multiobjective fractional programming problems with operator constraints. I: Theory
- Title not available (Why is that?)
- Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems
Cited In (10)
- Title not available (Why is that?)
- Higher order duality in multiobjective fractional programming problem with generalized convexity
- Higher order duality in multiobjective fractional programming with support functions
- Generalized hybrid \(B-(b, \rho, \theta, \tilde{p}, \tilde{r})\)-invexities and efficiency conditions for multiobjective fractional programming
- Semiparametric sufficient efficiency conditions for multiobjective fractional programming problems containing arbitrary norms
- On fractional vector optimization over cones with support functions
- Note on generalized invex functions
- Higher-order duality for multiobjective programming problem involving \((\Phi, \rho)\)-invex functions
- Generalized \((\rho, \eta, \theta )\)-invex functions and optimality conditions for multiple objective fractional subset programming
- Generalized \((\eta,\rho)\)-invex functions and semiparametric duality models for multiobjective fractional programming problems containing arbitrary norms
This page was built for publication: Generalized \((\eta,\rho)\)-invex functions and global semiparametric sufficient efficiency conditions for multiobjective fractional programming problems containing arbitrary norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857795)