Article ID: | iaor2002342 |
Country: | Netherlands |
Volume: | 98 |
Issue: | 1 |
Start Page Number: | 101 |
End Page Number: | 122 |
Publication Date: | Dec 2000 |
Journal: | Annals of Operations Research |
Authors: | Rumchev V.G., Caccetta L. |
This paper is a survey of reachability and controllability results for discrete-time positive linear systems. It presents a variety of criteria in both algebraic and digraph forms for recognising these fundamental system properties with direct implications not only in dynamic optimization problems (such as those arising in inventory and production control, manpower planning, scheduling and other areas of operations research) but also in studying properties of reachable sets, in feedback control problems, and others. The paper highlights the intrinsic combinatorial structure of reachable/controllable positive linear systems and reveals the monomial components of such systems. The system matrix decomposition into monomial components is demonstrated by solving some illustrative examples.