Editing Convex hull (section)

===Combinatorial optimization===
In [[combinatorial optimization]] and [[polyhedral combinatorics]], central objects of study are the convex hulls of [[indicator vector]]s of solutions to a combinatorial problem. If the facets of these polytopes can be found, describing the polytopes as intersections of halfspaces, then algorithms based on [[linear programming]] can be used to find optimal solutions.<ref>{{harvtxt|Pulleyblank|1983}}; see especially remarks following Theorem 2.9.</ref> In [[multi-objective optimization]], a different type of convex hull is also used, the convex hull of the weight vectors of solutions. One can maximize any [[quasiconvex function|quasiconvex combination]] of weights by finding and checking each convex hull vertex, often more efficiently than checking all possible solutions.{{sfnp|Katoh|1992}}