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...
Saved in:
| Main Authors: | , |
|---|---|
| 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 |
| Summary: | 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. |
|---|