operations reasearch

Question 5: (15 points) Answer the questions a-i below according to the following DP formulation. For m-1.2..MuETm - Minimum veSm d The expressions will be referred by the letters written below them (e,g., d indicates: Zn(u,v) Which of the above a, b, c, d, e, f indicates the following? (Write a, b, c, d, e or f to the spaces provided) a. The stages are defined by: b. The feasibility of the decisions is defined by: c. The feasibility of the states is defined by: d. The return/cost function is defined by: e. The state transformations are defined by: f. The recursion is defined by: g. In the corresponding Network for this DP, the number of nodes at each stage h. In the corresponding Network for this DP, the number of arcs at each stage i. The optimal objective value for the stages (k, kt1.,...) for any can be determined by using: can be determined by using: feasible state is defined by: Question 5: (15 points) Answer the questions a-i below according to the following DP formulation. For m-1.2..MuETm - Minimum veSm d The expressions will be referred by the letters written below them (e,g., d indicates: Zn(u,v) Which of the above a, b, c, d, e, f indicates the following? (Write a, b, c, d, e or f to the spaces provided) a. The stages are defined by: b. The feasibility of the decisions is defined by: c. The feasibility of the states is defined by: d. The return/cost function is defined by: e. The state transformations are defined by: f. The recursion is defined by: g. In the corresponding Network for this DP, the number of nodes at each stage h. In the corresponding Network for this DP, the number of arcs at each stage i. The optimal objective value for the stages (k, kt1.,...) for any can be determined by using: can be determined by using: feasible state is defined by