3. (5) the answers to this question must be given on a form, the link to which you have been emailed. consider the following linear programming problem in 3 basic variables, x1, x2, x3, where s1–s4 are slack variables. maximize z = x1 + 0.5 x2 + x3 s. t. -x1 + x2 – x3 + s1 = 2 x1 – x2 – x3 + s2 = 3 -x1 - x2 + x3 + s3 = 1 x1 + x2 + x3 + s4 = 4 x1, x2, x3, s1, s2, s3, s4 ≥ 0 somewhere in the steps of optimization, the objective function can be written as: z = 2x1 + 1.5x2 – s3 + 1 and the constraints can be written as follow: -2x1 + s1 + s3 = 3 -2x2 + s2 + s3 = 4 -x1 – x2 + x3 + s3 = 1 2x1 + x2 – s3 + s4 = 3 a) (2) state what the leaving variable will be. b) (3) determine which will be the entering variable

step-by-step explanation:

i think you should think about the question and not look online.

the answer is (-8,-5)

step-by-step explanation:

the endpoint to midpoint is half the length. the length is (-2,-1) so when you are at the midpoint just add it to it to find your answer -6+(-2)= -8 and -4+(-1)=-5 so (-8,-5)

take the logarithm of both sides (the base of the log doesn't matter):

apply the exponent property - this says that :

distribute the log terms on both sides:

group like terms together:

divide through both sides by the coefficient on :

you can do some additional rewriting here using the properties of the logarithm to simplify things if you like:

-1   1/6.   you dont subtract the denominators

step-by-step explanation: