Scribd
Upload
4 views4 pages

Dynamic Programming - Multiple Choice Questions

The document contains a series of multiple-choice questions related to dynamic programming, covering topics such as optimization principles, key figures in the field, and specific problem-solving techniques. It includes questions on the definitions and characteristics of dynamic programming, as well as its applications in various scenarios. Answers to the questions are provided at the end of the document.

Uploaded by

a c s Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views4 pages

Dynamic Programming - Multiple Choice Questions

The document contains a series of multiple-choice questions related to dynamic programming, covering topics such as optimization principles, key figures in the field, and specific problem-solving techniques. It includes questions on the definitions and characteristics of dynamic programming, as well as its applications in various scenarios. Answers to the questions are provided at the end of the document.

Uploaded by

a c s Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Dynamic Programming - Multiple choice questions

1. In many situations, where a series of consecutive decisions are involved,


the overall return for the total period (say, e.g., one year) will be optimal,
if
(a) we optimize the return over each individual period (say, e.g., a month)
(b) we optimize the return for the total period, as a whole
(c) we optimize the returns for the sub–periods as per the decisions involved
(d) none of the above
2. The science of dynamic programming was developed by
(a) John Von Neumann` (b) Richard Bellman
(c) Samuel Johnson (d) Dantzig
3. A mathematical technique of optimizing a sequence of inter-related decisions
over a period of time is defined as
(a) Linear programming (b) Integer programming
(c) Dynamic programming (d) Non – linear programming
4. Dynamic programming problem can be divided into a sequence of sub –
problems, which are called the
(a) Stages of the original problem (b) States of the original problem

(c) Zones of the original problem (d) Returns of the original problem
5. In dynamic programming problems, which of the following represent the
different time periods in the overall period of the problem?
(a) Stages (b) States
(c) Zones (d) None of the above
6. In solving a travelling salesman problem by dynamic programming, which
of the following may be considered as a stage of the problem?
(a) Sub – period (b) Distance between any pair of cities
(c) Sales Zone (d) Decision taken in a state
7. In solving the salesman problem for the shortest route by dynamic programming
a specific city is referred to as a
(a) Stage (b) State variable
(c) Sales zone (d) Sub – stage
8. In dynamic programming, a decision made at each stage affects the
(a) State of the system at the next stage
(b) Stage of the system at the next state
(c) Return function at the next stage
(d) Return function at the next state
9. In dynamic programming, every decision has its own merit in terms of the
worth or benefit associated with it, which may be described in algebraic
form by an equation called the
(a) Present worth function (b) Recursive equation
(c) Return function (d) Stage function
10. In dynamic programming, the return function depends upon which of the
following?
(a)The stage and state variable
(b) The worth of the decision made at a particular stage
(c) The number of states
(d) The state variable and the decision made at a particular stage
11. The number of states in a stage (in a dynamic programming problem)
may be
(a) Finite (b) Infinite
(c) Finite or Infinite (d) Zero
12. Suppose a positive quantity ‘c’ is to be divided into ‘n’ parts such that
the product of the n parts is maximum. The maximum value of the product
resulting from the application of dynamic programming for this problem
will be

(a) (b)

(d)
(c)

13. An optimal policy (i.e., a set of decisions) has the property that whatever
be the initial state and initial decision, the remaining decisions must
constitute an optimal policy for the state resulting from the first decision
- this is known as the
(a) Maximin principle of optimality (b) Bellman’s principle of optimality
(c) Johnson’s principle of optimality (d) Dantzig’s principle of optimality

14. By solving using dynamic programming, we can show that ,


pi
subject to and > 0, will be minimum when
(a) p1 = p2 = p3 = ………….. = pn = (1/n) (b) p1 + p2 + p3 + ……. + pn = (1/n)

(c) p1.p2.p3…….pn = (1/n) (d) (1/p1) + (1/p2) + …. + (1/pn) = (1/n)

15. An L.P. problem of the type Maximize Z = c1x1 + c2x2 + - - - - + cnxn, subject
to ai1x1 +ai2x2 +…+ aijxj + ……+ainxn{≤ , = , ≥}bi , (i = 1, 2, 3, …., m) can be
considered as which type of a dynamic programming problem?
(a) n – state, m - stage (b) n – stage, m – state
(c) (n – m) stage (d) (n – m) state
Answers
1–d; 2–b; 3–c; 4–a; 5–a; 6–c; 7–b;
8- a; 9–c; 10 – d ; 11 – c ; 12 – d ; 13 – b ; 14 – a
15 – b.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy