Erschienen in:

1988 | OriginalPaper | Buchkapitel

Algorithmic Aspects of Convex Sets: Formulation of the Problems

verfasst von : Martin Grötschel, László Lovász, Alexander Schrijver

Erschienen in: Geometric Algorithms and Combinatorial Optimization

Verlag: Springer Berlin Heidelberg

Enthalten in: Professional Book Archive

Zugang erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Convex sets and convex functions are typical objects of study in mathematical programming, convex analysis, and related areas. Here are some key questions one encounters frequently: Given a point y and a set K, is y a member of K, i. e., is y contained in K ?If y is not a member of K, find a hyperplane separating y from K.Given a linear inequality, is it valid for each vector in K ?Given a linear function, find a point maximizing (or minimizing) the function on K.Given a convex function, find its minimum.

Springer Professional