Difference between revisions of "Category:MIP optimization"
From COST Action FP0804: FORSYS
(Created page with 'This category encompasses systems that use Mixed Integer Programming (MIP) optimization techniques for finding a solution for a complex combinatorial optimization problem, genera…') |
SeanGordon (Talk | contribs) m |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | This category encompasses systems that use Mixed Integer Programming (MIP) optimization techniques for finding a solution for a complex combinatorial optimization problem, generally by selecting a set of options through a rigorous mathematical solution procedure | + | This category encompasses systems that use Mixed Integer Programming (MIP) optimization techniques for finding a solution for a complex combinatorial optimization problem, generally by selecting a set of options through a rigorous mathematical solution procedure. |
| − | [[Category: | + | [[Category:Mathematical programming methods]] |
| + | [[Category:DSS Decision support approaches]] | ||
Latest revision as of 18:24, 14 October 2010
This category encompasses systems that use Mixed Integer Programming (MIP) optimization techniques for finding a solution for a complex combinatorial optimization problem, generally by selecting a set of options through a rigorous mathematical solution procedure.
