A turnpike theorem for rolling plans (Q1099765)

This paper analyzes the asymptotic properties of rolling plans in a multime selected problems of fuzzy optimization in networks are analyzed. The maximum-flow problem in a network with fuzzy arc capacities is considered in the first part of the paper. The fuzzy arc capacities are described by possibility distributions for feasible flows in the arcs. The criterion of maximization of the flow value is replaced in the problem with a fuzzy goal (a fuzzy set in the real line). The next problem considered concerns network analysis of a project with fuzzy activity times (fuzzy variables with given possibility distributions). Determination of the project's completion time is the main topic. The third part of the paper is devoted to a critical discussion on a possible approach to the shortest path problem in a network with fuzzy arc lengths.