The maximized value of the function is (c) 119/2
<h3>Maximization problem</h3>
Maximization problems are used to determine the optimal solution of a linear programming model
<h3>Objective function</h3>
The objective function is given as:
<h3>Constraints</h3>
The constraints are given as:
<h3>Graph</h3>
See attachment for the graph of the constraints
From the graph, the optimal solution is: (2.83, 2.83)
So, the maximized value is:
Approximate
Rewrite as a fraction
Hence, the maximized value of the function is (c) 119/2
Read more about maximization problem at:
brainly.com/question/16826001
Since the blue marbles are 11 and the red marbles are 7 you start will the red marbles first because the question say red marbles to blue marbles
7:11
Mean: so basically you add up all the numbers (5+12+1+5+7=30) and divide the sum (30) with how many numbers there are (5) so 30/5=6
mode: mode is numbers repeated, since there are two 5's it is the mode (you may also have multiple modes)
Answer: 210
Explanation: To find the least common multiple for the integers 30 and 35, we start by making a factor tree for each of our integers.
So 30 is 10 · 3 and 10 is 5 · 2.
35 is 7 · 5.
Notice that our 5's match up as factors of each of our integers.
When finding the least common multiple, we simply multiply all of our factors together but since the 5's match up,
we only multiply by a 5 once.
So our least common multiple or LCM is
5 · the 2 that doesn't match up · the 3 that
doesn't match up · the 7 that doesn't match up.
So we have 5 · 2 · 3 · 7 or 210.
Work is shown below.
Answer:
hmm... A is the answer but if anything comes up tell me
