Individual Assignment on LP, DP

Due date on 30Jan, 2023

1. A reservoir is constructed for water supply, irrigation and hydropower purpose. The total water
generating power will also be conveyed through a canal for irrigation purpose. The maximum
installed capacity of the hydropower requires is 25m3/s of water and the water supply system
requires a minimum of 5m3/s and maximum of 15m3/s. If the total average release from the
reservoir is 40m3/s, calculate the optimum release from the reservoir for each service. The
following table shows returns obtained from each service.

Service benefit
Hydropower 15Birr/m3
Water Supply 25Birr/m3
Irrigation 10Birr/m3

2. Solve the following Nonlinear programming:

A)

B) Find the stationery points and local and /or global minimum or maximum for the following
function

f(x) = x3 – 4.5x2 + 6x + 17

3. A fertilizer company purchases nitrates, phosphates, potash, and an inert chalk base at a cost of
$1500, $500, $1000, and $100 per ton, respectively, and produces four fertilizers A, B,C, and D.
The production cost, selling price, and composition of the four fertilizers are given below.

During any week, no more than 1000 tons of nitrate, 2000 tons of phosphates, and 1500 tons of
potash will be available. The company is required to supply a minimum of 5000 tons of fertilizer
A and 4000 tons of fertilizer D per week to its customers; but it is otherwise free to produce the
 fertilizers in any quantities it pleases. Formulate the problem of finding the quantity of each
fertilizer to be produced by the company to maximize its profit.
4. Using dynamic programming maximize the total returns obtained from the allocation of 60 units
of water for four water users. The allocation is possible in discrete units of 0, 10, 20, 30, 40, 50,
and 60. Returns from the four users for a given allocation are given in the table below.
Return from
User 1 User 2 User 3 User 4
Allocation R1(x1) R2(x2) R3(x3) R4(x4)
0 0 0 0 0
10 3 4 3 1
20 5 5 4 2
30 6 6 5 7
40 3 7 3 8
50 3 4 2 10
60 2 3 0 9

5. A pipeline is to be laid between start node and end node as shown in the Figure below. The
pipeline can pass only along the solid lines. Obtain the shortest distance for the pipeline using
dynamic programming.