Military and Security Applications: Cybersecurity (Encyclopedia of Optimization, Third Edition)

The domain of cybersecurity is growing as part of broader military and security applications, and the capabilities and processes in this realm have qualities and characteristics that warrant using solution methods in mathematical optimization. Problems of interest may involve continuous or discrete variables, a convex or non-convex decision space, differing levels of uncertainty, and constrained or unconstrained frameworks. Cyberattacks, for example, can be modeled using hierarchical threat structures and may involve decision strategies from both an organization or individual and the adversary. Network traffic flow, intrusion detection and prevention systems, interconnected human-machine interfaces, and automated systems – these all require higher levels of complexity in mathematical optimization modeling and analysis. Attributes such as cyber resiliency, network adaptability, security capability, and information technology flexibility – these require the measurement of multiple characteristics, many of which may involve both quantitative and qualitative interpretations. And for nearly every organization that is invested in some cybersecurity practice, decisions must be made that involve the competing objectives of cost, risk, and performance. As such, mathematical optimization has been widely used and accepted to model important and complex decision problems, providing analytical evidence for helping drive decision outcomes in cybersecurity applications. In the paragraphs that follow, this chapter highlights some of the recent mathematical optimization research in the body of knowledge applied to the cybersecurity space. The subsequent literature discussed fits within a broader cybersecurity domain taxonomy considering the categories of analyze, collect and operate, investigate, operate and maintain, oversee and govern, protect and defend, and securely provision. Further, the paragraphs are structured around generalized mathematical optimization categories to provide a lens to summarize the existing literature, including uncertainty (stochastic programming, robust optimization, etc.), discrete (integer programming, multiobjective, etc.), continuous-unconstrained (nonlinear least squares, etc.), continuous-constrained (global optimization, etc.), and continuous-constrained (nonlinear programming, network optimization, linear programming, etc.). At the conclusion of this chapter, research implications and extensions are offered to the reader that desires to pursue further mathematical optimization research for cybersecurity within a broader military and security applications context

A New Heuristic for Feature Selection by Consistent Biclustering

Given a set of data, biclustering aims at finding simultaneous partitions in biclusters of its samples and of the features which are used for representing the samples. Consistent biclusterings allow to obtain correct classifications of the samples from the known classification of the features, and vice versa, and they are very useful for performing supervised classifications. The problem of finding consistent biclusterings can be seen as a feature selection problem, where the features that are not relevant for classification purposes are removed from the set of data, while the total number of features is maximized in order to preserve information. This feature selection problem can be formulated as a linear fractional 0-1 optimization problem. We propose a reformulation of this problem as a bilevel optimization problem, and we present a heuristic algorithm for an efficient solution of the reformulated problem. Computational experiments show that the presented algorithm is able to find better solutions with respect to the ones obtained by employing previously presented heuristic algorithms

Multiobjective strategies for New Product Development in the pharmaceutical industry

New Product Development (NPD) constitutes a challenging problem in the pharmaceutical industry, due to the characteristics of the development pipeline. Formally, the NPD problem can be stated as follows: select a set of R&D projects from a pool of candidate projects in order to satisfy several criteria (economic profitability, time to market) while coping with the uncertain nature of the projects. More precisely, the recurrent key issues are to determine the projects to develop once target molecules have been identified, their order and the level of resources to assign. In this context, the proposed approach combines discrete event stochastic simulation (Monte Carlo approach) with multiobjective genetic algorithms (NSGAII type, Non-Sorted Genetic Algorithm II) to optimize the highly combinatorial portfolio management problem. In that context, Genetic Algorithms (GAs) are particularly attractive for treating this kind of problem, due to their ability to directly lead to the so-called Pareto front and to account for the combinatorial aspect. This work is illustrated with a study case involving nine interdependent new product candidates targeting three diseases. An analysis is performed for this test bench on the different pairs of criteria both for the bi- and tricriteria optimization: large portfolios cause resource queues and delays time to launch and are eliminated by the bi- and tricriteria optimization strategy. The optimization strategy is thus interesting to detect the sequence candidates. Time is an important criterion to consider simultaneously with NPV and risk criteria. The order in which drugs are released in the pipeline is of great importance as with scheduling problems

Multiobjective strategies for New Product Development in the pharmaceutical industry

New Product Development (NPD) constitutes a challenging problem in the pharmaceutical industry, due to the characteristics of the development pipeline. Formally, the NPD problem can be stated as follows: select a set of R&D projects from a pool of candidate projects in order to satisfy several criteria (economic profitability, time to market) while coping with the uncertain nature of the projects. More precisely, the recurrent key issues are to determine the projects to develop once target molecules have been identified, their order and the level of resources to assign. In this context, the proposed approach combines discrete event stochastic simulation (Monte Carlo approach) with multiobjective genetic algorithms (NSGAII type, Non-Sorted Genetic Algorithm II) to optimize the highly combinatorial portfolio management problem. In that context, Genetic Algorithms (GAs) are particularly attractive for treating this kind of problem, due to their ability to directly lead to the so-called Pareto front and to account for the combinatorial aspect. This work is illustrated with a study case involving nine interdependent new product candidates targeting three diseases. An analysis is performed for this test bench on the different pairs of criteria both for the bi- and tricriteria optimization: large portfolios cause resource queues and delays time to launch and are eliminated by the bi- and tricriteria optimization strategy. The optimization strategy is thus interesting to detect the sequence candidates. Time is an important criterion to consider simultaneously with NPV and risk criteria. The order in which drugs are released in the pipeline is of great importance as with scheduling problems

Genetic Land - Modeling land use change using evolutionary algorithms

Future land use configurations provide valuable knowledge for policy makers and economic agents, especially under expected environmental changes such as decreasing rainfall or increasing temperatures, or scenarios of policy guidance such as carbon sequestration enforcement. In this paper, modelling land use change is designed as an optimization problem in which landscapes (land uses) are generated through the use of genetic algorithms (GA), according to an objective function (e.g. minimization of soil erosion, or maximization of carbon sequestration), and a set of local restrictions (e.g. soil depth, water availability, or landscape structure). GAs are search and optimization procedures based on the mechanics of natural selection and genetics. The GA starts with a population of random individuals, each corresponding to a particular candidate solution to the problem. The best solutions are propagated; they are mated with each other and originate “offspring solutions” which randomly combine the characteristics of each “parent”. The repeated application of these operations leads to a dynamic system that emulates the evolutionary mechanisms that occur in nature. The fittest individuals survive and propagate their traits to future generations, while unfit individuals have a tendency to die and become extinct (Goldberg, 1989). Applications of GA to land use planning have been experimented (Brookes, 2001, Ducheyne et al, 2001). However, long-term planning with a time-span component has not yet been addressed. GeneticLand, the GA for land use generation, works on a region represented by a bi-dimensional array of cells. For each cell, there is a number of possible land uses (U1, U2, ..., Un). The task of the GA is to search for an optimal assignment of these land uses to the cells, evolving the landscape patterns that are most suitable for satisfying the objective function, for a certain time period (e.g. 50 years in the future). GeneticLand develops under a multi-objective function: (i) Minimization of soil erosion – each solution is validated by applying the USLE, with the best solution being the one that minimizes the landscape soil erosion value; (ii) Maximization of carbon sequestration – each solution is validated by applying atmospheric CO2 carbon uptake estimates, with the best solution being the one that maximizes the landscape carbon uptake; and (iii) Maximization of the landscape economic value – each solution is validated by applying an economic value (derived from expert judgment), with the best solution being the one that maximizes the landscape economic value. As an optimization problem, not all possible land use assignments are feasible. GeneticLand considers two sets of restrictions that must be met: (i) physical constraints (soil type suitability, slope, rainfall-evapotranspiration ratio, and a soil wetness index) and (ii) landscape ecology restrictions at several levels (minimum patch area, land use adjacency index and landscape contagion index). The former assures physical feasibility and the latter the spatial coherence of the landscape. The physical and landscape restrictions were derived from the analysis of past events based on a time series of Landsat images (1985-2003), in order to identify the drivers of land use change and structure. Since the problem has multiple objectives, the GA integrates multi-objective extensions allowing it to evolve a set of non-dominated solutions. An evolutive type algorithm – Evolutive strategy (1+1) – is used, due to the need to accommodate the very large solution space. Current applications have about 1000 decision variables, while the problem analysed by GeneticLand has almost 111000, generated by a landscape with 333*333 discrete pixels. GeneticLand is developed and validated for a Mediterranean type landscape located in southern Portugal. Future climate triggers, such as the increase of intense rainfall episodes, is accommodated to simulate climate change . This paper presents: (1) the formulation of land use modelling as an optimization problem; (2) the formulation of the GA for the explicit spatial domain, (3) the land use constraints derived for a Mediterranean landscape, (4) the results illustrating conflicting objectives, and (5) limitations encountered.

Best Subset Selection via a Modern Optimization Lens

In the last twenty-five years (1990-2014), algorithmic advances in integer optimization combined with hardware improvements have resulted in an astonishing 200 billion factor speedup in solving Mixed Integer Optimization (MIO) problems. We present a MIO approach for solving the classical best subset selection problem of choosing $k$ out of $p$ features in linear regression given $n$ observations. We develop a discrete extension of modern first order continuous optimization methods to find high quality feasible solutions that we use as warm starts to a MIO solver that finds provably optimal solutions. The resulting algorithm (a) provides a solution with a guarantee on its suboptimality even if we terminate the algorithm early, (b) can accommodate side constraints on the coefficients of the linear regression and (c) extends to finding best subset solutions for the least absolute deviation loss function. Using a wide variety of synthetic and real datasets, we demonstrate that our approach solves problems with $n$ in the 1000s and $p$ in the 100s in minutes to provable optimality, and finds near optimal solutions for $n$ in the 100s and $p$ in the 1000s in minutes. We also establish via numerical experiments that the MIO approach performs better than {\texttt {Lasso}} and other popularly used sparse learning procedures, in terms of achieving sparse solutions with good predictive power.Comment: This is a revised version (May, 2015) of the first submission in June 201

An Evolutionary Computational Approach for the Problem of Unit Commitment and Economic Dispatch in Microgrids under Several Operation Modes

In the last decades, new types of generation technologies have emerged and have been gradually integrated into the existing power systems, moving their classical architectures to distributed systems. Despite the positive features associated to this paradigm, new problems arise such as coordination and uncertainty. In this framework, microgrids constitute an effective solution to deal with the coordination and operation of these distributed energy resources. This paper proposes a Genetic Algorithm (GA) to address the combined problem of Unit Commitment (UC) and Economic Dispatch (ED). With this end, a model of a microgrid is introduced together with all the control variables and physical constraints. To optimally operate the microgrid, three operation modes are introduced. The first two attend to optimize economical and environmental factors, while the last operation mode considers the errors induced by the uncertainties in the demand forecasting. Therefore, it achieves a robust design that guarantees the power supply for different confidence levels. Finally, the algorithm was applied to an example scenario to illustrate its performance. The achieved simulation results demonstrate the validity of the proposed approach.Ministerio de Ciencia, Innovación y Universidades TEC2016-80242-PMinisterio de Economía y Competitividad PCIN-2015-043Universidad de Sevilla Programa propio de I+D+

Continuous Biochemical Processing: Investigating Novel Strategies to Produce Sustainable Fuels and Pharmaceuticals

Biochemical processing methods have been targeted as one of the potential renewable strategies for producing commodities currently dominated by the petrochemical industry. To design biochemical systems with the ability to compete with petrochemical facilities, inroads are needed to transition from traditional batch methods to continuous methods. Recent advancements in the areas of process systems and biochemical engineering have provided the tools necessary to study and design these continuous biochemical systems to maximize productivity and substrate utilization while reducing capital and operating costs. The first goal of this thesis is to propose a novel strategy for the continuous biochemical production of pharmaceuticals. The structural complexity of most pharmaceutical compounds makes chemical synthesis a difficult option, facilitating the need for their biological production. To this end, a continuous, multi-feed bioreactor system composed of multiple independently controlled feeds for substrate(s) and media is proposed to freely manipulate the bioreactor dilution rate and substrate concentrations. The optimal feed flow rates are determined through the solution to an optimal control problem where the kinetic models describing the time-variant system states are used as constraints. This new bioreactor paradigm is exemplified through the batch and continuous cultivation of β-carotene, a representative product of the mevalonate pathway, using Saccharomyces cerevisiae strain mutant SM14. The second goal of this thesis is to design continuous, biochemical processes capable of economically producing alternative liquid fuels. The large-scale, continuous production of ethanol via consolidated bioprocessing (CBP) is examined. Optimal process topologies for the CBP technology selected from a superstructure considering multiple biomass feeds, chosen from those available across the United States, and multiple prospective pretreatment technologies. Similarly, the production of butanol via acetone-butanol-ethanol (ABE) fermentation is explored using process intensification to improve process productivity and profitability. To overcome the inhibitory nature of the butanol product, the multi-feed bioreactor paradigm developed for pharmaceutical production is utilized with in situ gas stripping to simultaneously provide dilution effects and selectively remove the volatile ABE components. Optimal control and process synthesis techniques are utilized to determine the benefits of gas stripping and design a butanol production process guaranteed to be profitable