#TITLE_ALTERNATIVE#
This nal project will discuss the problems of decision making that was found during the author followed an internship program at the social foundation. One of the activities carried out by the Foundation is classroom reno- vation in four dierent areas in a regional. In implementation, the Foundat...
Saved in:
Main Author: | |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/19017 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
id |
id-itb.:19017 |
---|---|
spelling |
id-itb.:190172017-09-27T11:43:12Z#TITLE_ALTERNATIVE# ZAKARIA , MUHAMMAD Indonesia Final Project Greedy algorithm, Multiple Choice Knapsack Problem, and utility. INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/19017 This nal project will discuss the problems of decision making that was found during the author followed an internship program at the social foundation. One of the activities carried out by the Foundation is classroom reno- vation in four dierent areas in a regional. In implementation, the Foundation still has problems in the process of determining the classroom that will be renovated so the renovation that was done still out of target and the usage of the allocated funds is still not optimal. In this nal project is conducted to create a mathema- tical method to select classrooms which will be renovated so the renovation can reach the target and the allocated fund is optimally distributed. This problem is identied as multiple choice knapsack problem with the addition of some con- straints. In the process of selecting the classroom, the Foundation considers the need of renovation (utilities), equitable renovations at schools in each region and the submission of the allocated funds the amount of funds needed to renovate a classroom in a school. In the completion of this problem, the author uses the Greedy algorithm by considering factor of the selection as the eciency factor which is dene as utility divided by necessary funds. text |
institution |
Institut Teknologi Bandung |
building |
Institut Teknologi Bandung Library |
continent |
Asia |
country |
Indonesia Indonesia |
content_provider |
Institut Teknologi Bandung |
collection |
Digital ITB |
language |
Indonesia |
description |
This nal project will discuss the problems of decision making
that was found during the author followed an internship program at the social
foundation. One of the activities carried out by the Foundation is classroom reno-
vation in four dierent areas in a regional. In implementation, the Foundation still
has problems in the process of determining the classroom that will be renovated
so the renovation that was done still out of target and the usage of the allocated
funds is still not optimal. In this nal project is conducted to create a mathema-
tical method to select classrooms which will be renovated so the renovation can
reach the target and the allocated fund is optimally distributed. This problem
is identied as multiple choice knapsack problem with the addition of some con-
straints. In the process of selecting the classroom, the Foundation considers the
need of renovation (utilities), equitable renovations at schools in each region and
the submission of the allocated funds the amount of funds needed to renovate a
classroom in a school. In the completion of this problem, the author uses the
Greedy algorithm by considering factor of the selection as the eciency factor
which is dene as utility divided by necessary funds. |
format |
Final Project |
author |
ZAKARIA , MUHAMMAD |
spellingShingle |
ZAKARIA , MUHAMMAD #TITLE_ALTERNATIVE# |
author_facet |
ZAKARIA , MUHAMMAD |
author_sort |
ZAKARIA , MUHAMMAD |
title |
#TITLE_ALTERNATIVE# |
title_short |
#TITLE_ALTERNATIVE# |
title_full |
#TITLE_ALTERNATIVE# |
title_fullStr |
#TITLE_ALTERNATIVE# |
title_full_unstemmed |
#TITLE_ALTERNATIVE# |
title_sort |
#title_alternative# |
url |
https://digilib.itb.ac.id/gdl/view/19017 |
_version_ |
1821119709569875968 |