Partial vector invexity for n-set functions and minmax programming

DOI10.1007/BF03399201zbMATH Open1161.90523OpenAlexW2781456154MaRDI QIDQ1018973FDOQ1018973

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

optimality and duality\(n\)-set functions\(v\)-invexity

Mathematics Subject Classification ID

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

Cites Work

• On generalised convex mathematical programming
• Title not available (Why is that?)
• Duality for minmax programming involvingV-invex functions
• A transposition theorem with applications to constrained optimal control problems
• Sufficiency criteria and duality for nonlinear programs involving n-set functions
• Title not available (Why is that?)
• A note on fractional minmax programs containing \(n\)-set functions
• Title not available (Why is that?)

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)