| |
| | Mathematical Programming Glossary - D (Site not responding. Last check: 2007-10-21) |
 | | For example, if a bisection method is used (as in searching a sorted list), the divide and conquer recurrence is T(n) = T(n/2) + 2 for n=2,4,6,8,... |
 | | Another mathematical program with the property that its objective is always a bound on the original mathematical program, called the primal. |
 | | An example is that the class of cutting plane methods, associated with the Lagrangian dual, is dual to the column generation method of Dantzig-Wolfe decomposition. |
| carbon.cudenver.edu /~hgreenbe/glossary/D.html (2386 words) |
|