Interactive Excel Investigations in Management Mathematics
暂无分享,去创建一个
Suppose two trains leave two different stations but arrive at the same station from which a third train, connecting to the first two, departs. Let us denote the departure times of the trains as x1, x2 and x3 respectively, and the duration of the journeys of the first two trains (including the necessary times for changing the trains) by a1 and a2 respectively. Then x3 = max (x1 + a1, x2 + a2) which in the max-algebraic notation reads
[1] Peter Butkovic,et al. Regularity of Matrices in Min-algebra and Its Time- Complexity , 1995, Discret. Appl. Math..
[2] S. Gaubert,et al. Minimal (max,+) Realization of Convex Sequences , 1998 .