Sentence examples for constraints to be solved from inspiring English sources

Additionally, the problem generally involves too many constraints to be solved, and most previous works did not address occurrence of sudden incidents in HHC services (e.g., a nurse or a patient suddenly requests for a leave, and a patient suddenly changes the time slot to be treated) such that the original nurse roster could become infeasible.

This results in a two or multi-point boundary value problem, in the presence the constraints, to be solved for state and co-state variables.

The successive performance-based optimization of the structural system is a further leap forward that should be tackled simultaneously if problems of practical interest, often characterized by thousands of performance constraints, are to be solved.

One of the main obstacles for using the power-shaping approach is to write the dynamics in the required form, since a partial differential equation system submitted to sign constraints has to be solved.

Differently from the techniques commonly applied for the solution of this kind of flows, the proposed method does not require additional constraint equations to be solved in bladed regions and is therefore very simple to be implemented into existing axisymmetric CFD codes.

Accordingly, the credit delivery systems should have to be improved and bureaucracies and administrative credit constraints should have to be solved.

In the design of such distributed pipelining systems with timing constraint, several problems need to be solved: how to properly place buffers, assign functional unit types for each task, and select communication protocols for each pair of tasks.

The following objective function and linear-integer constraints describe the optimization problem to be solved in order to compute an optimal task allocation.

There is also an underlying expectation that the primary 'problem' to be solved within these time constraints is diagnosis and treatment.

Optimization problems subject to inequality constraints may be solved by the method of Karush-Kuhn-Tucker (KKT) conditions (Kuhn and Tucker, 1951).

Due to the efficient modelling and implementation of the superstructure and an appropriate setting of non-standard solver options, optimisation problems with up to 10,000 variables and constraints could be solved robustly without providing problem specific initial values or scaling factors.