Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized (,,)-V-invex functions and arbitrary norms
From MaRDI portal
(Redirected from Publication:874317)
Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms
Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms
Recommendations
- Generalized \((\eta,\rho)\)-invex functions and global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing arbitrary norms
- Parametric duality models for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms
- On sufficiency for discrete minmax fractional programming problems involving generalized $(\theta,\eta,\rho)-V$-univex functions
- Generalized \( (\eta,\rho)\)-invex functions and parametric duality models for discrete minmax fractional programming problems containing arbitrary norms
- Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions
Cites work
- scientific article; zbMATH DE number 3856842 (Why is no real title available?)
- scientific article; zbMATH DE number 3904354 (Why is no real title available?)
- scientific article; zbMATH DE number 4093201 (Why is no real title available?)
- scientific article; zbMATH DE number 3245841 (Why is no real title available?)
- A class of programming problems whose objective function contains a norm
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- Best Rational Approximation and Strict Quasi-Convexity
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- Discrete and fractional programming techniques for location models
- Further Generalizations of Convexity in Mathematical Programming
- Generalized \( (\eta,\rho)\)-invex functions and parametric duality models for discrete minmax fractional programming problems containing arbitrary norms
- Goal programming and multiple objective optimizations. Part I
- Invex functions and constrained local minima
- Invexity and generalized convexity
- Invexity at a point: generalisations and classification
- Matrix Analysis
- Multicriteria Programming for Financial Planning
- Nonsmooth invexity
- On An Invariant of Plane Regions and Mass Distributions
- On Nonlinear Fractional Programming
- On generalised convex mathematical programming
- On generalized convex functions in optimization theory -- a survey
- On sufficiency of the Kuhn-Tucker conditions
- Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems
- Optimality principles and duality models for a class of continuous-time generalized fractional programming problems with operator constraints
- The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
- The essence of invexity
- Various types of nonsmooth invex functions
- What is invexity?
Cited in
(9)- Parametric duality models for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms
- Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions
- On Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Under Generalized V-Invexity
- Hybrid \((\Phi ,\Psi ,\rho ,\zeta ,\theta)\)-invexity frameworks and efficiency conditions for multiobjective fractional programming problems
- scientific article; zbMATH DE number 6692297 (Why is no real title available?)
- Generalized \((\eta,\rho)\)-invex functions and global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing arbitrary norms
- Higher order hybrid invexity frameworks and discrete multiobjective fractional programming problems
- On sufficiency for discrete minmax fractional programming problems involving generalized $(\theta,\eta,\rho)-V$-univex functions
- Generalized \( (\eta,\rho)\)-invex functions and parametric duality models for discrete minmax fractional programming problems containing arbitrary norms
This page was built for publication: Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q874317)
