Sentence examples for constraints can be solved from inspiring English sources

It is seen that such a weighted sum-rate problem with more power constraints can be solved by solving a similar problem in (3).

The vagueness, ambiguities, and uncertainties faced by decision makers from their subjective perceptions and experiences in conducting judgments based on unquantifiable constraints can be solved effectively by using linguistic variables.

It is well known [11, 12] that the optimization with individual power constraints can be solved by reformulating it properly into an equivalent problem with a sum power constraint.

Posynomial models are widely used in various engineering design endeavors, such as circuits, aerospace and structural design, mainly due to the fact that design problems cast in terms of posynomial objectives and constraints can be solved efficiently by means of a convex optimization technique known as geometric programming (GP).

In fact, the optimization of certain types of non-linear problems can already be solved very efficiently and geometric programming problems with up to 1,000 variables and 10,000 constraints can be solved in minutes on a personal computer.

First, we show how the problem of minimizing the training energy subject to a quality constraint can be solved, while a 'dual' deterministic (average design) problem is considereda.

This constraint can be solved selecting proper machine setup conditions, which still largely relies on a trial and error method, and sometimes this approach is not optimum in a productivity sense.

For the case of peak and sum power constraints, (34) can be solved using the nested Newton algorithm.

The control design problem is transformed into a convex optimization problem with linear matrix inequality constraints, which can be solved efficiently with standard solvers.

The design procedure is posed as a quadratic programming problem with linear and quadratic constraints that can be solved using convex optimization packages.

This condition is given in terms of a system of linear matrix inequalities with rank constraints, and can be solved using some existing algorithms.