On alternative optimal solutions to quasimonotonic programming with linear constraints

DOI10.1007/S11766-007-0015-XzbMath1174.90834OpenAlexW2161379908MaRDI QIDQ2465013

Shengjia Xue

Publication date: 18 December 2007

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-007-0015-x

zbMATH Keywords

decomposition theorempolyhedral setconvex simplex methodalternative optimal solutionquasimonotonic programming problem

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple characterization of solutions sets of convex programs
• On characterizing the solution sets of pseudolinear programs
• Characterization of solution sets of convex programs

This page was built for publication: On alternative optimal solutions to quasimonotonic programming with linear constraints