Given: a set of linear constraints in two variables
aix + biy < ci
Find: the set of points I satisfying all constraints.
Divide-and-Conquer algorithm solves the problem
in O(n log n) time.
Linear Programming
| Minimize | ax + by | |
| Subject to | aix + biy < ci, i=1,2,...,n |
Simplifying assumption: The problem is bounded,
i.e., the first 2 constraints are assumed to be bounding.