1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
LenKa [72]
2 years ago
7

3x - 2y; when x = 4 and y = 6

Mathematics
1 answer:
Mumz [18]2 years ago
8 0
The answer is 0 since it is 12-12.
You might be interested in
A painter earns $15 per hour.What is the minimum number of hours he must work to earn at least $200?
babunello [35]
12 hours in order to make 200 dollars
5 0
3 years ago
Provide an example of optimization problem
Mashutka [201]

Answer:

a. Convex solutions ,GO Methods

b. market efficiency

Explanation :

Step-by-step explanation:

A globally optimal solution is one where there are no other feasible solutions with better objective function values. A locally optimal solution is one where there are no other feasible solutions "in the vicinity" with better objective function values. You can picture this as a point at the top of a "peak" or at the bottom of a "valley" which may be formed by the objective function and/or the constraints -- but there may be a higher peak or a deeper valley far away from the current point.

In convex optimization problems, a locally optimal solution is also globally optimal. These include LP problems; QP problems where the objective is positive definite (if minimizing; negative definite if maximizing); and NLP problems where the objective is a convex function (if minimizing; concave if maximizing) and the constraints form a convex set. But many nonlinear problems are non-convex and are likely to have multiple locally optimal solutions, as in the chart below. (Click the chart to see a full-size image.) These problems are intrinsically very difficult to solve; and the time required to solve these problems to increases rapidly with the number of variables and constraints.

GO Methods

Multistart methods are a popular way to seek globally optimal solutions with the aid of a "classical" smooth nonlinear solver (that by itself finds only locally optimal solutions). The basic idea here is to automatically start the nonlinear Solver from randomly selected starting points, reaching different locally optimal solutions, then select the best of these as the proposed globally optimal solution. Multistart methods have a limited guarantee that (given certain assumptions about the problem) they will "converge in probability" to a globally optimal solution. This means that as the number of runs of the nonlinear Solver increases, the probability that the globally optimal solution has been found also increases towards 100%.

Where Multistart methods rely on random sampling of starting points, Continuous Branch and Bound methods are designed to systematically subdivide the feasible region into successively smaller subregions, and find locally optimal solutions in each subregion. The best of the locally optimally solutions is proposed as the globally optimal solution. Continuous Branch and Bound methods have a theoretical guarantee of convergence to the globally optimal solution, but this guarantee usually cannot be realized in a reasonable amount of computing time, for problems of more than a small number of variables. Hence many Continuous Branch and Bound methods also use some kind of random or statistical sampling to improve performance.

Genetic Algorithms, Tabu Search and Scatter Search are designed to find "good" solutions to nonsmooth optimization problems, but they can also be applied to smooth nonlinear problems to seek a globally optimal solution. They are often effective at finding better solutions than a "classic" smooth nonlinear solver alone, but they usually take much more computing time, and they offer no guarantees of convergence, or tests for having reached the globally optimal solution.

5 0
3 years ago
Please help out with some of these.
nikdorinn [45]

Answer:

1. 1/12

2. 1/8

3. 1/6

4. 1/6

5. 1/4

6. 1/8

7. 1/6

8. 1/8

9. 1/12

Step-by-step explanation:

6 0
3 years ago
A grapefruit is 8% heavier than an orange, and an apple is 10% lighter than the orange.
qwelly [4]
A = 0.9 o 
<span>so, </span>
<span>o = a/0.9 = 1.111a </span>
<span>so, the orange is 11% heavier than the apple. 

glad i could help(:</span>
6 0
3 years ago
Read 2 more answers
Turning 2.45 into a percent
olya-2409 [2.1K]
As a percent is out of 100% or 1 (as a whole number), the best thing to do is multiply it by ten, until you get a whole number. As you cannot have a decimal in a percentage. 2.45x10= 24.5. This is still a decimal, so you need to multiply it be ten again, 24.5x10= 245. Therefore, 2.45 is a percent is 245%
8 0
3 years ago
Read 2 more answers
Other questions:
  • Ben bought the enormous box of juice shown below. He drinks 450 cubic centimeters of juice each day.
    12·2 answers
  • I need to be able to know how to put that in a graph
    9·1 answer
  • Andre placed some quarters and 1 dime into a money-counting machine. The machine reported that Andre has more than $5.00. Which
    11·1 answer
  • Helen spends 12% of her budget on transpiration expenses. Write this percent as a fraction and decimal and explain how.
    9·1 answer
  • A chicken soup recipe calls for cups of chicken stock. How much is this in quarts?
    11·1 answer
  • Given the function g(x) = -3x + 4, compare and contrast g(-2) and g(4). Choose the statement that is true concerning these two v
    8·2 answers
  • 5x6x6x6x6x6xx6x6x6x6
    8·1 answer
  • Please work out -80 ÷ -8​
    9·2 answers
  • CAN ANYONE HELP ME WITH THIS
    6·1 answer
  • X and Y intercepts of y=1/3x
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!