Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized (,,)-V-invex functions and arbitrary norms

DOI10.1007/BF02831955zbMATH Open1151.90037OpenAlexW2035595011MaRDI QIDQ874317FDOQ874317

Authors: G. J. Zalmai 

Publication date: 5 April 2007

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02831955

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

zbMATH Keywords

sufficient optimality conditionsDiscrete minmax fractional programminggeneralized \((\theta, \eta, \rho)\)-V-invexity

Mathematics Subject Classification ID

Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Minimax problems in mathematical programming (90C47)

Cites Work

• Matrix Analysis
• On Nonlinear Fractional Programming
• 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
• On generalised convex mathematical programming
• 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
• Goal programming and multiple objective optimizations. Part I
• The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
• Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
• Multicriteria Programming for Financial Planning
• On An Invariant of Plane Regions and Mass Distributions
• Invexity and generalized convexity
• Discrete and fractional programming techniques for location models
• Title not available (Why is that?)
• Optimality principles and duality models for a class of continuous-time generalized fractional programming problems with operator constraints
• Best Rational Approximation and Strict Quasi-Convexity
• On generalized convex functions in optimization theory -- a survey
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimality conditions and duality models for a class of nonsmooth constrained fractional variational problems
• A class of programming problems whose objective function contains a norm
• Generalized \( (\eta,\rho)\)-invex functions and parametric duality models for discrete minmax fractional programming problems containing arbitrary norms

Cited In (9)

• Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions
• Parametric duality models for discrete minmax fractional programming problems containing generalized \((\theta,\eta,\rho)\)-V-invex functions and arbitrary norms
• On Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Under Generalized V-Invexity
• Generalized \((\eta,\rho)\)-invex functions and global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing arbitrary norms
• Title not available (Why is that?)
• Hybrid \((\Phi ,\Psi ,\rho ,\zeta ,\theta)\)-invexity frameworks and efficiency conditions for multiobjective fractional programming problems
• Generalized \( (\eta,\rho)\)-invex functions and parametric duality models 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

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)