Symmetric duality for minimax mixed integer programming problems with pseudo-invexity

DOI10.1016/j.ejor.2008.08.016zbMath1163.90672OpenAlexW2049387442MaRDI QIDQ1027577

J. Blot

Publication date: 30 June 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.08.016

zbMATH Keywords

separabilityself-dualitysymmetric dualityefficient solutionmultiobjective symmetric variational mixed integer problemspartial-pseudo-invexity

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symmetric duality for minimax multiobjective variational mixed integer programming problems with partial-invexity
• Pseudo-invexity and duality in nonlinear programming
• Multiobjective symmetric duality with cone constraints
• Minimax and symmetric duality for a class of multiobjective variational mixed integer programming problems.
• Minimax and symmetric duality for nonlinear multiobjective mixed integer programming
• Second order symmetric duality in mathematical programming with \(F\)-convexity
• Second order symmetric duality in multiobjective programming
• Symmetric duality for the multiobjective fractional variational problem with partial invexity
• Symmetric dual nonlinear programs
• Symmetric duality for variational problems
• A Duality Theorem for Convex Programs
• Duality for Multiobjective Variational Problems With Pseudo-Invexity
• A symmetric dual theorem for non-linear programs
• On Symmetric Duality in Nonlinear Programming
• Multiobjective second order symmetric duality with cone constraints

This page was built for publication: Symmetric duality for minimax mixed integer programming problems with pseudo-invexity