On minimax fractional programming of generalized convex set functions

DOI10.1006/jmaa.2000.6715zbMath1073.90543OpenAlexW2068703407MaRDI QIDQ1978809

Hang-Chin Lai, Jen-chwan Liu

Publication date: 14 December 2000

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.2000.6715

zbMATH Keywords

duality theoremsconvex set functionconvex family of measurable sets(\(\mathcal I, \rho, \theta\))-convex functions(\(\mathcal I, \rho, \theta\))-pseudoconvex functions(\(\mathcal I, \rho, \theta\))-quasiconvex functionssubdifferentiable set function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27)

Related Items (10)

Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions ⋮ Minimax fractional programming involving generalised invex functions ⋮ On a dynamic fractional game ⋮ Three types dual model for minimax fractional programming ⋮ On duality theorems for a nondifferentiable minimax fractional programming ⋮ Parameter-free dual models for fractional programming with generalized invexity ⋮ A taxonomy and review of the multi-objective fractional programming (MOFP) problems ⋮ Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity ⋮ A sixth bibliography of fractional programming ⋮ Complex fractional programming and the Charnes-Cooper transformation

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization theory for n-set functions
• Optimal constrained selection of a measurable subset
• Duality in mathematical programming of set functions: On Fenchel duality theorem
• Existence and Lagrangian duality for maximization of set-valued functions
• Moreau-Rockafellar type theorem for convex set functions
• Lagrange multiplier theorem of multiobjective programming problems with set functions
• On the optimality conditions of vector-valued \(n\)-set functions
• Duality for a minimax programming problem containing \(n\)-set functions
• Necessary and sufficient conditions for minimax fractional programming
• Duality without a constraint qualification for minimax fractional programming
• Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
• Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
• On duality of multiobjective fractional measurable subset selection problems
• Duality for generalized fractional programs involving n-set functions
• Optimality conditions and duality for multiobjective measurable subset selection problems
• Second order optimality conditions for mathematical prograramming with set functions
• The Fenchel-Moreau Theorem for Set Functions
• Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
• Saddle point and duality in the optimization theory of convex set functions
• Oil minmax programming problems containing n-set functions
• Minimax fractional programming involving generalised invex functions

This page was built for publication: On minimax fractional programming of generalized convex set functions