Showing 1 - 1 of 1
Mathematical programs with S-convex and with symmetric objective and feasibility regions are investigated. Optimal solutions and algorithms are presented for both continuous and discrete optimization problems.
Persistent link: https://www.econbiz.de/10009196609