The principle and models of dynamic programming. III (Q1813174): Difference between revisions

[For part II see the author, ibid 135, No. 1, 268-283 (1988; Zbl 0802.90110).] The author prepares two basic lemmas for optimization problems \(\text{Opt}[f(x)+ g(x)]\), \(\text{Opt}[f(x)g(x)]\) and \(\text{Opt}[f(x)/g(x)]\). The lemmas translate two problems -- a generalized Malfatti inequality and an inequality concerning both arithmetic and geometric means -- into two typical fractional programming problems. The author solves them without appealing to the fractional programming approach in order to demonstrate the validity of the DP approach. Throughout this and the preceding paper, suitable transitional constraints originated by the author play an important role in applying the DP approach.