MINMAX REGRET MASALAH OPTIMASI KOMBINATORIAL DENGAN DATA INTERVAL; MINMAX REGRET COMBINATORIAL OPTIMIZATION PROBLEM WITH INTERVAL DATA

QORIATUN MARYAMAH, Ari Suparwanto

2013 | Skripsi | PROGRAM STUDI MATEMATIKA

In this final project, we discuss about combinatorial optimization problem with data interval by using minmax regret decision theory. At the beginning of discussion will begins with a discussion of common optimization problem, then from the usual optimization problems are brought into a state of uncertainty, giving rise to an interval under the assumption that the optimization problem will achieve the optimum in the range of the interval. Using the concept of scenarios and by using minmax decision theory to obtain optimal state that minimizes a loss. Further examples are given the minimum spanning tree, shortest path and minimum assignment by using minmax regret decision theory

Kata Kunci : MINMAX REGRET; OPTIMASI KOMBINATORIAL; DATA INTERVAL