1993 | 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
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.