<p>An algorithm is developed for discrete optimization of zero-one resource allocation problems. A single constraint problem is first formulated in dynamic programming. This formulation then undergoes a number of modifications to develop the algorithm. This algorithm leads to a significant reduction in computational requirements as compared to the dynamic programming method. Three theorems and several lemmas are proved which are central in making the algorithm efficient. Different relevant features are included in the study to extend the algorithm to solve problems with more than one constraint.</p> / Master of Science (MS)
| Identifer | oai:union.ndltd.org:mcmaster.ca/oai:macsphere.mcmaster.ca:11375/7322 |
| Date | 09 1900 |
| Creators | Mowla, Golam |
| Contributors | Chakravarti, P.C., Computation |
| Source Sets | McMaster University |
| Detected Language | English |
| Type | thesis |
Page generated in 0.0019 seconds