Integer programming approach to capital budgeting

The thesis is about the application of the methods of Integer Programming particularly the Branch and Bound Algorithm to a replacement problem of a detergent bar manufacturing company. The objective is to select the proper machine to be replaced which will maximize the total net present value of the...

Full description

Saved in:
Bibliographic Details
Main Authors: Lim, Ma. Crisanta R., Ornido, Helen T.
Format: text
Language:English
Published: Animo Repository 1986
Subjects:
Online Access:https://animorepository.dlsu.edu.ph/etd_bachelors/15999
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
Language: English
id oai:animorepository.dlsu.edu.ph:etd_bachelors-16512
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:etd_bachelors-165122022-11-14T07:02:02Z Integer programming approach to capital budgeting Lim, Ma. Crisanta R. Ornido, Helen T. The thesis is about the application of the methods of Integer Programming particularly the Branch and Bound Algorithm to a replacement problem of a detergent bar manufacturing company. The objective is to select the proper machine to be replaced which will maximize the total net present value of the future cash flows of all the machines in operation under the constraints imposed by market demand and limited capital. 1986-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/15999 Bachelor's Theses English Animo Repository Integer programming Capital budget Budget
institution De La Salle University
building De La Salle University Library
continent Asia
country Philippines
Philippines
content_provider De La Salle University Library
collection DLSU Institutional Repository
language English
topic Integer programming
Capital budget
Budget
spellingShingle Integer programming
Capital budget
Budget
Lim, Ma. Crisanta R.
Ornido, Helen T.
Integer programming approach to capital budgeting
description The thesis is about the application of the methods of Integer Programming particularly the Branch and Bound Algorithm to a replacement problem of a detergent bar manufacturing company. The objective is to select the proper machine to be replaced which will maximize the total net present value of the future cash flows of all the machines in operation under the constraints imposed by market demand and limited capital.
format text
author Lim, Ma. Crisanta R.
Ornido, Helen T.
author_facet Lim, Ma. Crisanta R.
Ornido, Helen T.
author_sort Lim, Ma. Crisanta R.
title Integer programming approach to capital budgeting
title_short Integer programming approach to capital budgeting
title_full Integer programming approach to capital budgeting
title_fullStr Integer programming approach to capital budgeting
title_full_unstemmed Integer programming approach to capital budgeting
title_sort integer programming approach to capital budgeting
publisher Animo Repository
publishDate 1986
url https://animorepository.dlsu.edu.ph/etd_bachelors/15999
_version_ 1772835058712838144