Sentence examples for original constraint from inspiring English sources
This kind of transformation keeps the uncertainty of the original constraint region as much as possible.
Its geographic search is also often off, and even though you provide the service with a ZIP code, it seems to look far beyond your original constraint.
This type of conversion is able to keep the uncertainty of the original constraint region to a larger extent.
The approach in (10) turns out to be a relay selection technique with uniform gain allocation among only selected relays to fully satisfy the original constraint.
Therefore, we can change the original constraint into the following probability form: begin{array}{*{20}l} text{Pr} left[ {X = sumlimits_{i} {{X_{i}}} le I_{max }^{p}} right] ge 1 - varepsilon.
Thus, for the original constraint C2, we have the following convex reformulation (widetilde {C2}) composed of several sub-constraints widetilde{C2:}left{begin{array}{l} widetilde{C2.1.1}, widetilde{C2.1.2}, widetilde{C2.1.3}, C2.1.4, widetilde{C2.2.1}, C2.2.2, C2.3.
This is achieved by introducing additional constraints, and by slightly tightening the original constraints.
Also, it is shown how the algorithm performance can be improved by integrating suitable soft constraints with the original constraints.
On the other hand, soft constraints may allow for unnecessary violations of the original constraints, i.e., the constraints may be violated even if a valid solution that does not violate any constraints exists.
A multiobjective function is defined to have the mean and the standard deviation of the original objective function, while the constraints are supplemented by adding a penalty term to the original constraints.
Furthermore, the problem is reformulated by introducing an extra decision vector to transform the original constraints into linear constraints, and then, a two-phase method is presented to solve the problem efficiently.
