1,125 research outputs found
Reformulation and decomposition of integer programs
In this survey we examine ways to reformulate integer and mixed integer programs. Typically, but not exclusively, one reformulates so as to obtain stronger linear programming relaxations, and hence better bounds for use in a branch-and-bound based algorithm. First we cover in detail reformulations based on decomposition, such as Lagrangean relaxation, Dantzig-Wolfe column generation and the resulting branch-and-price algorithms. This is followed by an examination of Benders’ type algorithms based on projection. Finally we discuss in detail extended formulations involving additional variables that are based on problem structure. These can often be used to provide strengthened a priori formulations. Reformulations obtained by adding cutting planes in the original variables are not treated here.Integer program, Lagrangean relaxation, column generation, branch-and-price, extended formulation, Benders' algorithm
Optimal Cell Clustering and Activation for Energy Saving in Load-Coupled Wireless Networks
Optimizing activation and deactivation of base station transmissions provides
an instrument for improving energy efficiency in cellular networks. In this
paper, we study optimal cell clustering and scheduling of activation duration
for each cluster, with the objective of minimizing the sum energy, subject to a
time constraint of delivering the users' traffic demand. The cells within a
cluster are simultaneously in transmission and napping modes, with cluster
activation and deactivation, respectively. Our optimization framework accounts
for the coupling relation among cells due to the mutual interference. Thus, the
users' achievable rates in a cell depend on the cluster composition. On the
theoretical side, we provide mathematical formulation and structural
characterization for the energy-efficient cell clustering and scheduling
optimization problem, and prove its NP hardness. On the algorithmic side, we
first show how column generation facilitates problem solving, and then present
our notion of local enumeration as a flexible and effective means for dealing
with the trade-off between optimality and the combinatorial nature of cluster
formation, as well as for the purpose of gauging the deviation from optimality.
Numerical results demonstrate that our solutions achieve more than 60% energy
saving over existing schemes, and that the solutions we obtain are within a few
percent of deviation from global optimum.Comment: Revision, IEEE Transactions on Wireless Communication
Using the primal-dual interior point algorithm within the branch-price-and-cut method
AbstractBranch-price-and-cut has proven to be a powerful method for solving integer programming problems. It combines decomposition techniques with the generation of both columns and valid inequalities and relies on strong bounds to guide the search in the branch-and-bound tree. In this paper, we present how to improve the performance of a branch-price-and-cut method by using the primal-dual interior point algorithm. We discuss in detail how to deal with the challenges of using the interior point algorithm with the core components of the branch-price-and-cut method. The effort to overcome the difficulties pays off in a number of advantageous features offered by the new approach. We present the computational results of solving well-known instances of the vehicle routing problem with time windows, a challenging integer programming problem. The results indicate that the proposed approach delivers the best overall performance when compared with a similar branch-price-and-cut method which is based on the simplex algorithm
The Stochastic Shortest Path Problem : A polyhedral combinatorics perspective
In this paper, we give a new framework for the stochastic shortest path
problem in finite state and action spaces. Our framework generalizes both the
frameworks proposed by Bertsekas and Tsitsikli and by Bertsekas and Yu. We
prove that the problem is well-defined and (weakly) polynomial when (i) there
is a way to reach the target state from any initial state and (ii) there is no
transition cycle of negative costs (a generalization of negative cost cycles).
These assumptions generalize the standard assumptions for the deterministic
shortest path problem and our framework encapsulates the latter problem (in
contrast with prior works). In this new setting, we can show that (a) one can
restrict to deterministic and stationary policies, (b) the problem is still
(weakly) polynomial through linear programming, (c) Value Iteration and Policy
Iteration converge, and (d) we can extend Dijkstra's algorithm
Recommended from our members
Linear Gaussian Affine Term Structure Models with Unobservable Factors: Calibration and Yield Forecasting
This paper provides a significant numerical evidence for out-of-sample forecasting ability of linear Gaussian interest rate models with unobservable underlying factors. We calibrate one, two and three factor linear Gaussian models using the Kalman filter on two different bond yield data sets and compare their out-of-sample
forecasting performance. One step ahead as well as four step ahead out-of-sample forecasts are analyzed based on the weekly data. When evaluating the one step ahead forecasts, it is shown that a one factor model may be adequate when only the short-dated or only the long-dated yields are considered, but two and three factor
models performs significantly better when the entire yield spectrum is considered. Furthermore, the results demonstrate that the predictive ability of multi-factor models remains intact far
ahead out-of-sample, with accurate predictions available up to one year after the last calibration for one data set and up to three
months after the last calibration for the second, more volatile data set. The experimental data denotes two different periods with different yield volatilities, and the stability of model
parameters after calibration in both the cases is
deemed to be both significant and practically useful. When it comes to four step ahead predictions, the quality of forecasts deteriorates for all models, as can be expected, but the advantage of using a multi-factor model as compared to a one factor model is still significant.
In addition to the empirical study above, we also suggest a nonlinear filter based on linear programming for improving the term structure matching at a given point in time. This method,
when used in place of a Kalman filter update, improves the term structure fit significantly with a minimal added computational overhead. The improvement achieved with the proposed method is
illustrated for out-of-sample data for both the data sets. This method can be used to model a parameterized yield curve consistently with the underlying short rate dynamics
The positive edge pricing rule for the dual simplex
International audienceIn this article, we develop the two-dimensional positive edge criterion for the dual simplex. This work extends a similar pricing rule implemented by Towhidi et al. [24] to reduce the negative effects of degeneracy in the primal simplex. In the dual simplex, degeneracy occurs when nonbasic variables have a zero reduced cost, and it may lead to pivots that do not improve the objective value. We analyze dual degeneracy to characterize a particular set of dual compatible variables such that if any of them is selected to leave the basis the pivot will be nondegenerate. The dual positive edge rule can be used to modify any pivot selection rule so as to prioritize compatible variables. The expected effect is to reduce the number of pivots during the solution of degenerate problems with the dual simplex. For the experiments, we implement the positive edge rule within the dual simplex of the COIN-OR LP solver, and combine it with both the dual Dantzig and the dual steepest edge criteria. We test our implementation on 62 instances from four well-known benchmarks for linear programming. The results show that the dual positive edge rule significantly improves on the classical pricing rules
A new revenue maximization model using customized plans in cloud service allocation (Applied on a real company case study)
Cloud computing is emerging as a promising field offering a variety of computing services to end users. These services are offered at different prices using various pricing schemes and techniques. End users will favor the service provider offering the best quality with the lowest price. Therefore, applying a fair pricing model will attract more customers and achieve higher revenues for service providers. This work focuses on a novel dynamic pricing model which is able to satisfy advance users requirements based on normal fixed price model. This paper considers many factors that affect pricing and user satisfaction, such as fairness, QoS, SLA, and more, by highlighting their importance in recent markets and propose a flexible model which tries to utilize all resources to the highest capacity and offers low prices for underutilized resources. The simulated results shows the appropriateness of dynamic pricing for sharing of computing resources, where providers want to have more customers as a managerial decision and even more income in total.Keywords: Cloud Computing; Digital Pricing; Dynamic Pricin
- …