Which of the following statements is false? a. A feasible solution satisfies all constraints.
b. In a linear programming problem, the objective function and the constraints must be linear functions of the decision variables.
c. It is possible to have exactly two optimal solutions to a linear programming problem.
d. An optimal solution to a linear programming problem can be found at an extreme point of the feasible region for the problem.

I've been working on this for a few days and i just don't understand, it's due in a few hours. you.the direction of a vector is defined as the angle of the vector in relation to a horizontal line. as a standard, this angle is measured counterclockwise from the positive x-axis. the direction or angle of v in the diagram is α.part a: how can you use trigonometric ratios to calculate the direction α of a general vector v = < x, y> similar to the diagram? part bsuppose that vector v lies in quadrant ii, quadrant iii, or quadrant iv. how can you use trigonometric ratios to calculate the direction (i.e., angle) of the vector in each of these quadrants with respect to the positive x-axis? the angle between the vector and the positive x-axis will be greater than 90 degrees in each case.part cnow try a numerical problem. what is the direction of the vector w = < -1, 6 > ?