Chaotic Solutions in Dynamic Linear Programming
Chaotic Solutions in Dynamic Linear Programming
复制标题
动态线性规划中的混沌解
DOI：
10.1016/s0960-0779(96)00005-7
复制
发表时间：
1996
影响因子：
7.8
通讯作者：
M. Yano
中科院分区：
文献类型：
--
作者：
K. Nishimura;M. Yano
混沌现象在科学的各个领域都被观察到。我们关注的是线性规划（LP），并表明混沌可能会出现作为一个动态LP问题的解决方案。为了这个目的，我们研究了一个无限时域问题，因为混沌出现在一个没有终止日期的动力系统中。因此，要找到一个解决方案并不简单，也不能从简单的重复算术中得出。相反，在有限时间范围的情况下，至少在理论上，可以通过这样的方法获得解;单纯形法就是这样一种过程，系统地重复计算。
Chaotic phenomena have been observed in various fields of sciences. We are concerned with linear programming (LP) and demonstrate that chaos may emerge as a solution to a dynamic LP problem. For this purpose, we work with an infinite time-horizon problem, for chaos appears in a dynamical system with no terminal date. As a result, it is not straightforward to find a solution, which cannot be derived from a simple repetition of arithmetics. In the finite time-horizon case, in contrast, a solution can be, at least in theory, obtained by such a method; the simplex method is one such procedure, repeating computations systematically.