Dynamic Programming: Self Test Questions


1. What is Dynamic Programming ? In what areas of management can it be applied successfully?

2. Discus briefly:

The general similarities between dynamic and linear programming

  • How dynamic programming differs from linear programming?

3. Define the following terms

  • Stage
  • State
  • Principle of optimality


1. Maximize z = x1 + 9x2

subject to
2x1 + x2 £ 25
x2 £ 11

x1, x2 ³ 0

2. Maximize z = 3x1 + x2

subject to
x1£ 2
x2 £ 4
2x1 + x2 £ 6

x1, x2 ³ 0

3. The XYZ Trucking company has to deliver a shipment of goods from city A to city D as shown below. The numbers on the arcs represent the estimated driving times in hours between adjacent cities. The company wants to determine the route requiring the shortest travel time.

Solve the problem and find the minimum time and its associated optimal route.

Dynamic Programming: Self Test Questions

Share and Recommend