Scribd
Upload
75 views

Assignment or

This document provides three optimization problems to solve using dynamic programming. The first problem involves allocating a maximum capital of Rs. 5 million across three investment plants to maximize total returns. The second problem involves scheduling five jobs on a single machine to minimize total tardiness. The third problem involves loading a cargo of four items with a maximum weight of 7 tons to maximize total return. For each problem, students are instructed to identify the stages and states, state the recursive function, and submit the assignment in report format.

Uploaded by

fterasawmy
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
75 views

Assignment or

This document provides three optimization problems to solve using dynamic programming. The first problem involves allocating a maximum capital of Rs. 5 million across three investment plants to maximize total returns. The second problem involves scheduling five jobs on a single machine to minimize total tardiness. The third problem involves loading a cargo of four items with a maximum weight of 7 tons to maximize total return. For each problem, students are instructed to identify the stages and states, state the recursive function, and submit the assignment in report format.

Uploaded by

fterasawmy
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ADVANCED OPERATIONAL RESEARCH METHODS Assignment 1

Unit 1: DYNAMIC PROGRAMMING Handout date: 17th September 2013 Tutor: Mr. R.Ajodhea Hand in date: 01st October 2013

1. An organization is planning to diversify its business with a maximum outlay of Rs. 5 million. It has identified three different locations to install plants. The organization can invest in one or more of these plants subject to the availability of the fund. The different possible alternatives and their investment (in million of rupees) and present worth of returns during the useful life (in million of rupees) of each of these plants are summarized in the table below. The first row of the table has zero cost and zero return for all plants. Hence, it is known as do-nothing alternative.

Alternative 1 2 3 4

Plant 1 Cost 0 1 2 3 Return 0 15 18 28 Cost 0 2 3 4

Plant 2 Return 0 14 18 21 Cost 0 1 2 -

Plant 3 Return 0 3 7 -

Using dynamic programming, find the optimal allocation of the capital to different plants which will maximize the corresponding sum of the present worth of returns.

2. Consider the single machine scheduling problem which is shown in the table below in which each of the 5 jobs can be fully processed in the same single machine. The other data in this table are the processing time and the due date for each of the jobs. Find the best sequence which minimizes the total tardiness using dynamic programming method. (T j = Cj dj, if Cj > dj; otherwise, it is 0, where Cj is the completion time of the job j)

Job j tj dj

1 5 15

2 8 25

3 6 15

4 7 10

5 9 20

3. Alpha logistic company has to load a cargo out of four items whose details are shown in the table below. The maximum weight of the cargo is 7 tons. Find the optimal cargo loading using dynamic programming method such that the total return is maximized

Item i Weight, wi/unit(in tons) Return, ri/unit(in rupees)

1 2 1000

2 1 400

3 4 2100

4 3 1400

Note: 1. This assignment should be submitted in report format. 2. The stage and state for all problems should be identified and clearly stated. 3. The recursive function for all problems should be clearly stated. 4. The use of appropriate software is permitted.

You might also like