Go backward to 4 Isomorphism
Go up to Main Page
Go forward to 6 Realizability

5 Optimization

In this section, next to the original linear programming problem, we describe some of its relatives. In particular, combinatorial abstractions of the problem are important with respect to polytope theory (and, more general, discrete geometry). We pick out the aspect of combinatorial cube programming here (and leave aside abstractions like general combinatorial linear programming, LP-type problems, and oriented matroid programming), since it has received considerable attention lately.

  • 25 Linear Programming
  • 26 Optimal Vertex
  • 27 Vertex With Specified Objective Value
  • 28 AOF Cube Programming
  • 29 USO Cube Programming