Generalized Convexity, Generalized Monotonicity: Recent Results by Jean-Pierre C
216,97 €
A function is convex if its epigraph is convex. Separation theorems lead to optimality conditions and duality for convex problems. A function is quasiconvex if its lower level sets are convex. Optimality conditions and duality can be derived for optimization problems involving such functions as well.
Jetzt bei Ebay:
