We consider the problem of solving packing/covering LPs online, when the columns of the constraint matrix are presented in random order. This problem has received much attention: the main open question is to figure out how large the right-hand sides of the LPs have to be (compared to the entries on the left-hand side of the constraint) to get (1 + ε)-approximations online? It is known that the ...

This paper describes an exact ε-constraint method for bi-objective combinatorial optimization problems with integer objective values. This method tackles multi-objective optimization problems by solving a series of single objective subproblems, where all but one objective are transformed into constraints. We show in this paper that the Pareto front of bi-objective problems can be efficiently ge...

In general, microgrids have a high renewable energy abandonment rate and grid construction operation costs. To improve the microgrid utilization rate, economic advantages, environmental safety of power operation, we propose hybrid storage capacity optimization method for wind–solar–diesel grid-connected system, based on an augmented ε- constraint method. First, battery is coupled with seasonal ...

We formulate a set of Bell's inequalities for the system of two correlated neutral kaons coming from the decay of a φ-meson, without assuming CP and CP T invariance. We show that a non-vanishing value of the phenomenological parameter ε ′ would violate such inequalities, ruling out Bell's locality.

Since the 1964 discovery of KL → π+π− [1], understanding CP violation has been a major goal of particle physics. Subsequent experiments showed that the dominant mechanism of CP violation in neutral kaons (still the only particle system in which CP violation has been observed) is a small asymmetry between K0 → K and K → K0 mixing. This asymmetry, referred to as indirect CP violation, results in ...

We present efficient distributed δ-approximation algorithms for fractional packing and maximum weighted b-matching in hypergraphs, where δ is the maximum number of packing constraints in which a variable appears (for maximum weighted b-matching δ is the maximum edge degree — for graphs δ = 2). (a) For δ = 2 the algorithm runs in O(logm) rounds in expectation and with high probability. (b) For g...

This paper aims to solve the problem of robust model predictive control, contradiction system robustness, and conservative terminal constraint set range. A control (RMPC) method based on an ε-approximation single-tube is proposed. We construct a RMPC structure for linear discrete time invariant systems with additive disturbances. To this structure, we add state estimation feedback improve conve...