Duality for a minimax programming problem containing n-set functions

DOI10.1006/JMAA.1998.6187MaRDI QIDQ1279952zbMATH OpenOpenAlexFDO

Authors Hang-Chin Lai, Jen-chwan Liu

Publication date 17 February 1999

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

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

zbMATH Keywords

differentiable \(n\)-set functionsdiscrete minimax programming problemduality theoremsminimax fractional problemnecessary and sufficient optimality conditions

Mathematics Subject Classification ID

Existence of solutions for minimax problems (49J35) Multi-objective and goal programming (90C29) Fractional programming (90C32)

Recommendations

• On minimax fractional programming of generalized convex set functions
• Oil minmax programming problems containing n-set functions
• Duality for minmax \(B\)-vex programming involving \(n\)-set functions
• On duality theorems for a nondifferentiable minimax fractional programming

Cites work

• Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
• Duality for Fractional Minimax Programming^∗∗The research is partly supported by NSC, Taiwan.$ef:
• Duality for generalized fractional programs involving n-set functions
• Duality for multiobjective fractional programming involving \(n\)-set functions
• Duality in mathematical programming of set functions: On Fenchel duality theorem
• Duality theorem of nondifferentiable convex multiobjective programming
• Duality without a constraint qualification for minimax fractional programming
• Efficiency and duality for nonlinear multiobjective programs involving \(n\)-set functions
• Existence and Lagrangian duality for maximization of set-valued functions
• scientific article; zbMATH DE number 682561 (Why is no real title available?)
• Lagrange multiplier theorem of multiobjective programming problems with set functions
• Moreau-Rockafellar type theorem for convex set functions
• Multiobjective Fractional Duality Forn-Set Functions
• Necessary and sufficient conditions for minimax fractional programming
• Oil minmax programming problems containing n-set functions
• On duality of multiobjective fractional measurable subset selection problems
• On the optimality conditions of vector-valued n-set functions
• On the optimality of differentiable nonconvex n-set functions
• Optimal constrained selection of a measurable subset
• Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
• Optimality and duality for generalized fractional programming involving nonsmooth pseudoindex functions
• Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions
• Optimality and duality for multiobjective programming involving subdifferentiable set functions
• Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions
• Optimality conditions and duality for multiobjective measurable subset selection problems
• Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions
• Optimality for set functions with values in ordered vector spaces
• Optimization of set-valued functions
• Optimization theory for n-set functions
• Saddle point and duality in the optimization theory of convex set functions
• Strong duality for infinite-dimensional vector-valued programming problems
• Sufficiency criteria and duality for nonlinear programs involving n-set functions
• The Fenchel-Moreau Theorem for Set Functions

Cited in

(14)

• Minimax fractional programming for n-set functions and mixed-type duality under generalized Invexity
• Parameter-free dual models for fractional programming with generalized invexity
• Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized ( F,,) -convex functions
• Three types dual model for minimax fractional programming
• On minimax fractional programming of generalized convex set functions
• Sufficiency in multiobjective subset programming involving generalized type-I functions
• A sixth bibliography of fractional programming
• Oil minmax programming problems containing n-set functions
• scientific article; zbMATH DE number 1248144 (Why is no real title available?)
• Minimax fractional programming involving generalised invex functions
• On duality theorems for a nondifferentiable minimax fractional programming
• Sufficiency criteria and duality for nonlinear programs involving n-set functions
• Duality for minmax programs
• Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions

This page was built for publication: Duality for a minimax programming problem containing \(n\)-set functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1279952)