Suppose we are given an oracle which, given a system of liear inequality constraints, either returns a vector that satisfies all inequalities in the system, or states that no such vector exists. consider a linear programming problem that admits an optimal solution. construct a simple algorithm that invokes the oracle once, and that finds an optimal solution of the linear programming problem.

7.25

step-by-step explanation:

we know that 7 equals to 7.0. we also know that 1/4=0.25. so we can add the two together and we get 7.25

hello!

to begin with, we're given that on earth, a rock weighs 20 pounds, and while on jupiter, that same rock weighs 42 pounds. now, we're trying to find the weight of a rock that weighs 10.5 pounds on earth, on jupiter.

to solve this, first, set up a proportion, cross-multiply, and solve it algebraically.

setting up the proportion is the hardest and the most confusing part of the problem, but it's simple.

if on earth, the rock weighs 20 lbs, and on jupiter it weighs 42 lbs, our first part of our proportion is 20/42 lbs. the second part has to be equal to each other. this means that 10.5 has to be on the numerator of the fraction, and x, the value we're trying to find, has to be on the denominator. remember that the rock weighs 10.5 lbs on earth, and we're trying to find the weight of it on jupiter (which is x).

20/42 = 10.5/x

next, you would cross-multiply.

20x = 42(10.5)

20x = 441

now, solve it algebraically by using division.

x = 22.05 lbs

this can be rounded to 22.1 lbs.

therefore, the weight of the rock on jupiter is 22.1 lbs, the fourth choice.

since no one answered yet i will give it a shot, not completely sure tho.

i think it should be y=cos(x+2pi), (third answer, answer c)

good luck.