MINMAX REGRET MASALAH OPTIMASI KOMBINATORIAL DENGAN DATA INTERVAL
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 unc...
| Main Authors: | , |
|---|---|
| Format: | Thesis |
| Published: |
[Yogyakarta] : Universitas Gadjah Mada
2014
|
| Subjects: |
| Summary: | 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. |
|---|