Identifiability of a single module in a network of transfer functions is determined by whether a particular transfer function in the network can be uniquely distinguished within a network model set, on the basis of data. Whereas previous research has focused on the situations that all network signals are either excited or measured, we develop generalized analysis results for the situation of partial measurement and partial excitation. As identifiability conditions typically require a sufficient number of external excitation signals, this article introduces a novel network model structure such that excitation from unmeasured noise signals is included, which leads to less conservative identifiability conditions than relying on measured excitation signals only. More importantly, graphical conditions are developed to verify global and generic identifiability of a single module based on the topology of the dynamic network. Depending on whether the input or the output of the module can be measured, we present four identifiability conditions which cover all possible situations in single module identification. These conditions further lead to synthesis approaches for allocating excitation signals and selecting measured signals, to warrant single module identifiability. In addition, if the identifiability conditions are satisfied for a sufficient number of external excitation signals only, indirect identification methods are developed to provide a consistent estimate of the module. All the obtained results are also extended to identifiability of multiple modules in the network.

In a dynamic network of interconnected transfer functions, it is not necessary to use all the node signals for estimating a local transfer function. Given the network topology, detailed conditions are available for selecting inputs and outputs in a (MIMO) predictor model that warrants consistent and minimum variance estimation of a target module through the so-called local direct method. Motivated by the existing minimum-input signal selection approach that gradually incorporates additional signals, an alternative graphical algorithm for signal selection is developed in this work by directly exploiting the complete network graph. Then, as a straightforward application of existing analytical results, graphical conditions for consistent identification are derived for the novel signal selection approach. We show by an example that in some cases, for the consistent estimation of the target module, the developed method leads to fewer selected signals than the original minimum-input method.

Model-based optimization of the water-flooding process in oil reservoirs suffers from high levels of uncertainty arising from strongly varying economic conditions and limited knowledge of the reservoir model parameters. To handle uncertainty, diverse robust optimization approaches that use an ensemble of uncertain parameter realizations (i.e., scenarios), have been adopted. However, in scenario-based approaches, the effect of considering a finite set of scenarios on the constraint violation and/or the performance degradation with respect to the unseen scenarios have not been studied. In this paper, we provide probabilistic guarantees on the worst-case performance degradation of a scenario-based solution. By using statistical learning, we analyze the impact of the number of scenarios on the probabilistic guarantees for the worst-case solution subject to both economic and geological uncertainties. For the economic uncertainty, we derive an explicit a-priori relationship between the probabilistic guarantee and the number of considered scenarios, while for the geological uncertainty, a-posteriori probabilistic upper bounds on the worst-case solution are given.