Symmetric duality for minimax multiobjective variational mixed integer programming problems with partial-invexity
From MaRDI portal
Publication:872243
DOI10.1016/j.ejor.2006.04.045zbMath1121.90110OpenAlexW2017278606MaRDI QIDQ872243
Publication date: 27 March 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.04.045
mixed integer programmingself-dualitysymmetric dualityclosed convex conemultiobjective variational problemspartial-invexity
Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (3)
Weakly efficient solutions and pseudoinvexity in multiobjective control problems ⋮ Efficient solutions in V-KT-pseudoinvex multiobjective control problems: A characterization ⋮ Symmetric duality for minimax mixed integer programming problems with pseudo-invexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a pair of nonlinear mixed integer programming problems
- A class of nondifferentiable continuous programming problems
- Minimax and symmetric duality for a nonlinear mixed-integer programming problem
- A note on pseudo-invexity and symmetric duality
- Duality for multiobjective fractional variational problems
- Minimax and symmetric duality for a class of multiobjective variational mixed integer programming problems.
- Minimax and symmetric duality for nonlinear multiobjective mixed integer programming
- Duality for multiobjective variational problems with invexity
- Symmetric duality for the multiobjective fractional variational problem with partial invexity
- Symmetric dual nonlinear programs
- Duality for variational problems
- Symmetric Dual Continuous Fractional Programming
- A symmetric dual theorem for non-linear programs
- On Symmetric Duality in Nonlinear Programming
This page was built for publication: Symmetric duality for minimax multiobjective variational mixed integer programming problems with partial-invexity