Answer:
d. An optimal solution to linear programming problem can be found at an extreme point of the feasible region for the problem.
Step-by-step explanation:
A feasible solution satisfies all the constraints of the problem in linear programming. The constraints are the restrictions on decision variable. They limit the value of decision variable in linear programming. Optimal solutions occur when there is feasible problem in the programming.
Bc i the one i the only reason i to go to earth lol i to see ur acc lol i’m lol oh wow wow so cute lol lol oh wow lol oh bc my
A = (3,2)
B = (7,5)
The difference between x coordinates is 7-3 = 4, which squares to 4^2 = 16
The difference in y coordinates is 5-2 = 3 which squares to 3^2 = 9
add up the squares: 16+9 = 25
Then take the square root: sqrt(25) = 5
So the distance from A to B is 5 units
The length of segment AB is 5 units
The scale factor of 3 tells us to lengthen the segment by a factor of 3. In other words, triple the length
new length = (scale factor)*(old length)
new length = (3)*(5)
new length = 15
Answer: 15
Answer:
7,8
Step-by-step explanation:
Answer:
The graph is a parabola with vertex (0 , -2)
Equation: y = x² -2
For x = -2, y = (-2)² -2 ⇒ y = 4 - 2 ⇒ y = 2
For x = -1, y = (-1)² -2 ⇒ y = 1 - 2 ⇒ y = -1
For x = 0, y = (0)² -2 ⇒ y = 0 - 2 ⇒ y = -2
For x = 1, y = (1)² -2 ⇒ y = 1 - 2 ⇒ y = -1
For x = 2, y = (2)² -2 ⇒ y = 4 - 2 ⇒ y = 2