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...

Full description

Saved in:
Bibliographic Details
Main Authors: , QORIATUN MARYAMAH, , Ari Suparwanto, M.SiDr. rer. Nat
Format: Theses and Dissertations NonPeerReviewed
Published: [Yogyakarta] : Universitas Gadjah Mada 2014
Subjects:
ETD
Online Access:https://repository.ugm.ac.id/126586/
http://etd.ugm.ac.id/index.php?mod=penelitian_detail&sub=PenelitianDetail&act=view&typ=html&buku_id=66813
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universitas Gadjah Mada
id id-ugm-repo.126586
record_format dspace
spelling id-ugm-repo.1265862016-03-04T08:07:38Z https://repository.ugm.ac.id/126586/ MINMAX REGRET MASALAH OPTIMASI KOMBINATORIAL DENGAN DATA INTERVAL , QORIATUN MARYAMAH , Ari Suparwanto, M.SiDr. rer. Nat ETD 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. [Yogyakarta] : Universitas Gadjah Mada 2014 Thesis NonPeerReviewed , QORIATUN MARYAMAH and , Ari Suparwanto, M.SiDr. rer. Nat (2014) MINMAX REGRET MASALAH OPTIMASI KOMBINATORIAL DENGAN DATA INTERVAL. UNSPECIFIED thesis, UNSPECIFIED. http://etd.ugm.ac.id/index.php?mod=penelitian_detail&sub=PenelitianDetail&act=view&typ=html&buku_id=66813
institution Universitas Gadjah Mada
building UGM Library
country Indonesia
collection Repository Civitas UGM
topic ETD
spellingShingle ETD
, QORIATUN MARYAMAH
, Ari Suparwanto, M.SiDr. rer. Nat
MINMAX REGRET MASALAH OPTIMASI KOMBINATORIAL DENGAN DATA INTERVAL
description 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.
format Theses and Dissertations
NonPeerReviewed
author , QORIATUN MARYAMAH
, Ari Suparwanto, M.SiDr. rer. Nat
author_facet , QORIATUN MARYAMAH
, Ari Suparwanto, M.SiDr. rer. Nat
author_sort , QORIATUN MARYAMAH
title MINMAX REGRET MASALAH OPTIMASI KOMBINATORIAL DENGAN DATA INTERVAL
title_short MINMAX REGRET MASALAH OPTIMASI KOMBINATORIAL DENGAN DATA INTERVAL
title_full MINMAX REGRET MASALAH OPTIMASI KOMBINATORIAL DENGAN DATA INTERVAL
title_fullStr MINMAX REGRET MASALAH OPTIMASI KOMBINATORIAL DENGAN DATA INTERVAL
title_full_unstemmed MINMAX REGRET MASALAH OPTIMASI KOMBINATORIAL DENGAN DATA INTERVAL
title_sort minmax regret masalah optimasi kombinatorial dengan data interval
publisher [Yogyakarta] : Universitas Gadjah Mada
publishDate 2014
url https://repository.ugm.ac.id/126586/
http://etd.ugm.ac.id/index.php?mod=penelitian_detail&sub=PenelitianDetail&act=view&typ=html&buku_id=66813
_version_ 1681232463252160512