Examples of using Optimization problem in English and their translations into Portuguese
{-}
-
Colloquial
-
Official
-
Medicine
-
Financial
-
Ecclesiastic
-
Ecclesiastic
-
Computer
-
Official/political
It really becomes an optimization problem.
This next optimization problem that I have been sent seems fun.
And you might be wondering, Sal,what is an optimization problem.
An optimization problem can be represented in the following way.
The first order conditions for this optimization problem are.
People also translate
An optimization problem seeks to minimize a loss function.
This outer-level loop comes down to solving an optimization problem.
The nsp is an optimization problem classified as non polynomial hard np-hard.
This problem is formulated as a mixed integer non-linear optimization problem.
Each constraint in an optimization problem has a shadow price or dual variable.
We use the primal-dual interior point method for solving the optimization problem.
This optimization problem is similar to the decision problem SUBSET-SUM.
This paper presents an alternative to optimization problem for queuing networks.
In this work, we propose two proximal methods for unconstrained multiobjective optimization problem.
By convention, the standard form of an optimization problem is stated in terms of minimization.
The optimization problem permits approximation and is approximable within a formula_9 approximation ratio.
To establish the substitution effect another optimization problem has to be considered.
An optimization problem with discrete variables is known as a combinatorial optimization problem.
Pathwidth, a different NP-complete optimization problem involving linear layouts of graphs.
Multiprocessor scheduling has been one of the most classic np-hard optimization problem.
This constrained optimization problem is typically solved using the method of Lagrange multipliers.
The computational task of determining the bipartite dimension for a given graph G is an optimization problem.
In this master¿s thesis it is discussed the portfolio optimization problem using the passive investment strategy of index tracking.
The optimization problem is: Minimize C p1 x1+ p2 x2 with respect to x1 and x2 subject to the constraint u(x1, x2) u0.
The decision problem is one of Karp's 21 NP-complete problems; hence the optimization problem is NP-hard.
To solve this optimization problem using a max-min ant system algorithm-(mmas), a variant of the ant colony algorithm.
The design of analog circuit can be modeled as an optimization problem and solved by optimization heuristics.
NP optimization problem===An"NP-optimization problem"(NPO) is a combinatorialoptimization problem with the following additional conditions.
Finally, a more robust gate is designed by modifying the quantum optimization problem using some weighted average fidelity as the objective functional.
Even though we could introduce suitable decision problems, the problem is more naturally characterized as an optimization problem.