On minimax fractional programming of generalized convex set functions
type: Item
instance of: scholarly article
title: On minimax fractional programming of generalized convex set functions
zbMATH Open document ID: 1073.90543
author: Hang-Chin Lai
author: Jen-chwan Liu
published in: Journal of Mathematical Analysis and Applications
publication date: 2000-12-14T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 1449217
zbMATH Keywords: subdifferentiable set function
zbMATH Keywords: convex set function
zbMATH Keywords: convex family of measurable sets
zbMATH Keywords: (\(\mathcal I, \rho, \theta\))-convex functions
zbMATH Keywords: (\(\mathcal I, \rho, \theta\))-pseudoconvex functions
zbMATH Keywords: (\(\mathcal I, \rho, \theta\))-quasiconvex functions
zbMATH Keywords: duality theorems
MaRDI profile type: Publication
full work available at URL: jmaa.2000.6715
OpenAlex ID: W2068703407
cites work: Q4312260
cites work: Second order optimality conditions for mathematical prograramming with set functions
cites work: Optimization theory for n-set functions
cites work: Existence and Lagrangian duality for maximization of set-valued functions
cites work: Lagrange multiplier theorem of multiobjective programming problems with set functions
cites work: Saddle point and duality in the optimization theory of convex set functions
cites work: Duality in mathematical programming of set functions: On Fenchel duality theorem
cites work: Moreau-Rockafellar type theorem for convex set functions
cites work: The Fenchel-Moreau Theorem for Set Functions
cites work: Minimax fractional programming involving generalised invex functions
cites work: Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
cites work: Duality without a constraint qualification for minimax fractional programming
cites work: Necessary and sufficient conditions for minimax fractional programming
cites work: Duality for a minimax programming problem containing \(n\)-set functions
cites work: Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
cites work: On the optimality conditions of vector-valued \(n\)-set functions
cites work: Optimal constrained selection of a measurable subset
cites work: Oil minmax programming problems containing n-set functions
cites work: On duality of multiobjective fractional measurable subset selection problems
cites work: Duality for generalized fractional programs involving n-set functions
cites work: Optimality conditions and duality for multiobjective measurable subset selection problems
cites work: Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
cites work: Programming problems involving generalized convex set functions
DOI: 10.1006/JMAA.2000.6715
description: scientific article; zbMATH DE number 1449217