Pick a unit equilateral triangle having A as a vertex, and also B and C. Then exactly one of B and C is in the set. If we pick unit equilateral triangle BCD, then D (short for Different from A) must be in the set with A. So if A is in the set, then every point with distance r (where r^2 is 3) from A is in the set. Find the coordinates of the vertices of the feasible region. From the graph, the vertices are at (0, 2), (3, 2), (9, 0), and (0, 0). Write the function to be maximized. The function that describes the income is f(m, p) = 40m + 120p. We want to find the maximum value for this function. In general, the feasible region will be a polygon for a linear programming problem. And the question asks us to find the extreme values of our objective function 𝑝 equals four 𝑥 minus three 𝑦 in this feasible region; that is, where 𝑥 and 𝑦 are the 𝑥 and 𝑦 coordinates of a point in the feasible region. On this page we'll list the Nameles Treasure Locations , and explain how you can trade in the If you need more Genshin Impact help, check out our pages on finding the Geovishap Hatchlings to There are three Nameless Treasures total in the Liyue region. They're located in the Dunyu Ruins , the...