Consider a linear programming problem in standard form and assume that the rows of a are linearly independent. for each one of the following statements, provide either a proof or a counterexample. (a) let x* be a basic feasible solution. suppose that for every basis corresponding to x* , the associated basic solution to the dual is infeasible. then, the optimal cost must be strictly less that c' x* .

the answer to this question is yes

based on context clues you gave i'm assuming the answer would be c.

this is the formula: v = the value of investment at the end of the time period

p = the principal amount (the initial amount invested)

r = the annual interest rate

n = the annual frequency of compounding (how many times a year interest is added)

t = the number of years the money is invested

^ means raise to the power of

1,407.5 hours

step-by-step explanation:

we first convert all the time to hours and then sum them up.

there are 24 hours in 1 day, in 58 days, there are 24 x 58 = 1,392 hours.

there are 60 minutes in 1 hour, thus, 30 minutes will be equivalent to 30 / 60 = 0.5 hours.

therefore, the number of hours it will take mercury to complete a full rotation is 1,392 + 15 + 0.5 = 1,407.5 hours