Subset Selection by Mallows’ Cp: A Mixed Integer Programming Approach

This paper concerns a method of selecting the best subset of explanatory variables for a linear regression model. Employing Mallows’ C_p as a goodness-of-fit measure, we formulate the subset selection problem as a mixed integer quadratic programming problem. Computational results demonstrate that our method provides the best subset of variables in a few seconds when … Read more

Models and Solution Techniques for Production Planning Problems with Increasing Byproducts

We consider a production planning problem where the production process creates a mixture of desirable products and undesirable byproducts. In this production process, at any point in time the fraction of the mixture that is an undesirable byproduct increases monotonically as a function of the cumulative mixture production up to that time. The mathematical formulation … Read more

Generalized Gauss Inequalities via Semidefinite Programming

A sharp upper bound on the probability of a random vector falling outside a polytope, based solely on the first and second moments of its distribution, can be computed efficiently using semidefinite programming. However, this Chebyshev-type bound tends to be overly conservative since it is determined by a discrete worst-case distribution. In this paper we … Read more

Directional Sensor Control: Heuristic Approaches

We study the problem of controlling multiple 2-D directional sensors while maximizing an objective function based on the information gain corresponding to multiple target locations. We assume a joint prior Gaussian distribution for the target locations. A sensor generates a (noisy) measurement of a target only if the target lies within the field-of-view of the … Read more

Uniqueness Conditions for A Class of $\ell_0hBcMinimization Problems

We consider a class of $\ell_0$-minimization problems, which is to search for the partial sparsest solution to an underdetermined linear system with additional constraints. We introduce several concepts, including $l_p$-induced quasi-norm ($0

Equivalence and Strong Equivalence between Sparsest and Least $\ell_1hBcNorm Nonnegative Solutions of Linear Systems and Their Application

Many practical problems can be formulated as $\ell_0$-minimization problems with nonnegativity constraints, which seek the sparsest nonnegative solutions to underdetermined linear systems. Recent study indicates that $\ell_1$-minimization is efficient for solving some classes of $\ell_0$-minimization problems. From a mathematical point of view, however, the understanding of the relationship between $\ell_0$- and $\ell_1$-minimization remains incomplete. In … Read more

Finding the Most Likely Infection Path in Networks with Limited Information

In this paper we address the problem of identifying the most likely infection pattern responsible for the spread of a disease in a network. In particular, we focus on the scenario where limited information (i.e. infection reports) is available during an ongoing outbreak. For this problem we propose a maximum likelihood model and present an … Read more

Reactive Power Management using Firefly and Spiral Optimization under Static and Dynamic Loading Conditions

Power System planning encompasses the concept of minimization of transmission losses keeping in mind the voltage stability and system reliability. Voltage profile decides the state of a system and its control is dependent on Generator source voltage, shunt/series injection, transformer taps etc. Optimal parameter setting in system level is needed for managing the available resources … Read more

Optimal control modeling of cell division

This paper investigates the population dynamics of a system of identically prepared B cells whose proliferation trajectories have been individually tracked using live-cell imaging techniques. The main goal is to investigate whether the system behavior can be determined using an optimality criterion. In order to achieve this goal we assume the existence of an intracellular … Read more

Turnpike theorems for convex problems with undiscounted integral functionals

In this paper the turnpike property is established for convex optimal control problems, involving undiscounted utility function and differential inclusions defined by multi-valued mapping having convex graph. Utility function is concave but not necessarily strictly concave. The turnpike theorem is proved under the main assumption that over any given line segment, either multi-valued mapping is … Read more