Category Archives: Optimization

Genetic Algorithms, Using JGAP, for the Examinations Timetabling Problem

Hello again,

Today I want to test JGAP, so I need a relatively simple optimization problem. The University of Toronto Examination Timetabling Problem (ETP) is an interesting benchmark problem that is fairly simple to implement in code, based on real universities examination problem instances. Read the rest of this entry

The Simplex Algorithm

The Simplex algorithm (Dantzig, 1947) solves efficiently Linear Programming problems. A Linear Programming problem has the form (A is an mxn matrix, c, x and b are n sized vectors):

$\begin{array}{cl} \text{minimize }& z = c^Tx \\ \text{subject to }& Ax \leq b \\ & x \geq 0 \\ \end{array}$