The problem of locating p maximally dispersed points in a convex space is considered. This problem is formulated as a non-linear programming problem. It is shown that this problem, in a square, is ...

Roughly, we will cover the following topics (some of them may be skipped depending on the time available). Linear Programming: Basics, Simplex Algorithm, and Duality. Applications of Linear ...

Integer linear programming can help find the answer to a variety of real-world problems. Now researchers have found a much faster way to do it. The traveling salesperson problem is one of the oldest ...