Partial vector invexity for n-set functions and minmax programming

DOI10.1007/BF03399201MaRDI QIDQ1018973zbMATH OpenOpenAlexFDO

Authors J. Martínez

Publication date 26 May 2009

Published in Opsearch (Search for Journal in Brave)

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

zbMATH Keywords

\(n\)-set functions\(v\)-invexityoptimality and duality

Mathematics Subject Classification ID

Existence of solutions for minimax problems (49J35) Minimax problems in mathematical programming (90C47)

Cites work

• A note on fractional minmax programs containing \(n\)-set functions
• A transposition theorem with applications to constrained optimal control problems
• Duality for minmax programming involvingV-invex functions
• scientific article; zbMATH DE number 1664578 (Why is no real title available?)
• scientific article; zbMATH DE number 4008134 (Why is no real title available?)
• scientific article; zbMATH DE number 20895 (Why is no real title available?)
• On generalised convex mathematical programming
• Sufficiency criteria and duality for nonlinear programs involving n-set functions

This page was built for publication: Partial vector invexity for \(n\)-set functions and minmax programming

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