44 research outputs found
Quadratic Binary Programming Models in Computational Biology
In this paper we formulate four problems in computational molecular biology as 0-1 quadratic programs. These problems are all NP-hard and the current solution methods used in practice consist of heuristics or approximation algorithms tailored to each problem. Using test problems from scientific databases, we address the question, “Can a general-purpose solver obtain good answers in reasonable time?” In addition, we use the latest heuristics as incumbent solutions to address the question, “Can a general-purpose solver confirm optimality or find an improved solution in reasonable time?” Our computational experiments compare four different reformulation methods: three forms of linearization and one form of quadratic convexification
Handling Interference in Integrated HAPS-Terrestrial Networks through Radio Resource Management
Vertical heterogeneous networks (vHetNets) are promising architectures to
bring significant advantages for 6G and beyond mobile communications. High
altitude platform station (HAPS), one of the nodes in the vHetNets, can be
considered as a complementary platform for terrestrial networks to meet the
ever-increasing dynamic capacity demand and provide sustainable wireless
networks for future. However, the problem of interference is the bottleneck for
the optimal operation of such an integrated network. Thus, designing efficient
interference management techniques is inevitable. In this work, we aim to
design a joint power-subcarrier allocation scheme in order to achieve fairness
for all users. We formulate the max-min fairness (MMF) optimization problem and
develop a rapid converging iterative algorithm to solve it. Numerical results
validate the superiority of the proposed algorithm and show better performance
over other conventional network scenarios.Comment: 7 pages, 3 figures, Accepted by IEEE Wireless Communications Letter
The Machine-Part Cell Formation Problem with Non-Binary Values: A MILP Model and a Case of Study in the Accounting Profession
The traditional machine-part cell formation problem simultaneously clusters machines
and parts in different production cells from a zero–one incidence matrix that describes the existing
interactions between the elements. This manuscript explores a novel alternative for the well-known
machine-part cell formation problem in which the incidence matrix is composed of non-binary values.
The model is presented as multiple-ratio fractional programming with binary variables in quadratic
terms. A simple reformulation is also implemented in the manuscript to express the model as a
mixed-integer linear programming optimization problem. The performance of the proposed model
is shown through two types of empirical experiments. In the first group of experiments, the model
is tested with a set of randomized matrices, and its performance is compared to the one obtained
with a standard greedy algorithm. These experiments showed that the proposed model achieves
higher fitness values in all matrices considered than the greedy algorithm. In the second type of
experiment, the optimization model is evaluated with a real-world problem belonging to Human
Resource Management. The results obtained were in line with previous findings described in the
literature about the case study
Tight Polyhedral Representations of Discrete Sets Using Projections, Simplices, and Base-2 Expansions
This research effort focuses on the acquisition of polyhedral outer-approximations to the convex hull of feasible solutions for mixed-integer linear and mixed-integer nonlinear programs. The goal is to produce desirable formulations that have superior size and/or relaxation strength. These two qualities often have great influence on the success of underlying solution strategies, and so it is with these qualities in mind that the work of this dissertation presents three distinct contributions. The first studies a family of relatively unknown polytopes that enable the linearization of polynomial expressions involving two discrete variables. Projections of higher-dimensional convex hulls are employed to reduce the dimensionality of the requisite linearizing polyhedra. For certain lower dimensions, a complete characterization of the convex hull is obtained; for others, a family of facets is acquired. Furthermore, a novel linearization for the product of a bounded continuous variable and a general discrete variable is obtained. The second contribution investigates the use of simplicial facets in the formation of novel convex hull representations for a class of mixed-discrete problems having a subset of their variables taking on discrete, affinely independent realizations. These simplicial facets provide new theoretical machinery necessary to extend the reformulation-linearization technique (RLT) for mixed-binary and mixed-discrete programs. In doing so, new insight is provided which allows for the subsumation of previous mixed-binary and mixed-discrete RLT results. The third contribution presents a novel approach for representing functions of discrete variables and their products using logarithmic numbers of 0-1 variables in order to economize on the number of these binary variables. Here, base-2 expansions are used within linear restrictions to enforce the appropriate behavior of functions of discrete variables. Products amongst functions are handled by scaling these linear restrictions. This approach provides insight into, improves upon, and subsumes recent related linearization methods from the literature
Mixed Integer Linear Programming Formulation Techniques
A wide range of problems can be modeled as Mixed Integer Linear Programming (MIP) problems using standard formulation techniques. However, in some cases the resulting MIP can be either too weak or too large to be effectively solved by state of the art solvers. In this survey we review advanced MIP formulation techniques that result in stronger and/or smaller formulations for a wide class of problems
Bundle methods for regularized risk minimization with applications to robust learning
Supervised learning in general and regularized risk minimization in particular is about solving optimization problem which is jointly defined by a performance measure and a set of labeled training examples. The outcome of learning, a model, is then used mainly for predicting the labels for unlabeled examples in the testing environment. In real-world scenarios: a typical learning process often involves solving a sequence of similar problems with different parameters before a final model is identified. For learning to be successful, the final model must be produced timely, and the model should be robust to (mild) irregularities in the testing environment. The purpose of this thesis is to investigate ways to speed up the learning process and improve the robustness of the learned model. We first develop a batch convex optimization solver specialized to the regularized risk minimization based on standard bundle methods. The solver inherits two main properties of the standard bundle methods. Firstly, it is capable of solving both differentiable and non-differentiable problems, hence its implementation can be reused for different tasks with minimal modification. Secondly, the optimization is easily amenable to parallel and distributed computation settings; this makes the solver highly scalable in the number of training examples. However, unlike the standard bundle methods, the solver does not have extra parameters which need careful tuning. Furthermore, we prove that the solver has faster convergence rate. In addition to that, the solver is very efficient in computing approximate regularization path and model selection. We also present a convex risk formulation for incorporating invariances and prior knowledge into the learning problem. This formulation generalizes many existing approaches for robust learning in the setting of insufficient or noisy training examples and covariate shift. Lastly, we extend a non-convex risk formulation for binary classification to structured prediction. Empirical results show that the model obtained with this risk formulation is robust to outliers in the training examples
DECISION SUPPORT FOR OPTIMAL WELL PLACEMENT, INFRASTRUCTURE INSTALLATION AND PRODUCTION PLANNING IN OIL FIELDS
Ph.DDOCTOR OF PHILOSOPH