Dynamic programming and bellmans principle of optimality


Question 1: Describe the term Dynamic programming.

Question 2: Describe Bellman’s principle of optimality.

Question 3: Solve the given LPP by using Dynamic programming:

Maximize Z = 3x1 + 4x2
Sub To 2x1 + 5x2 > 120
           2x1 + x2 < 40
x1, x2 > 0

Question 4: Solve Minimize Z = x12 + x22 + x32
Sub To x1 + x2 + x3 = 15
x1, x2, x3 > 0

Question 5: A company interested in selecting the advertising media for its product. The frequency of advertising per week and the corresponding expected sales in thousands of rupees are given below:

739_expected sales.jpg

The costs of advertising in news paper, radio and television are Rs 500, Rs 1000 and Rs 2000 respectively per appearance. The budget provides Rs 4000 per week for advertisement. Determine the optimal combination of advertising media and frequency.

Request for Solution File

Ask an Expert for Answer!!
Operation Research: Dynamic programming and bellmans principle of optimality
Reference No:- TGS03371

Expected delivery within 24 Hours