Please answer the following questions.

1		Linear programming will generate an optimal solution to an LP problem if one exists.
			A)	True
			B)	False
2		The solution to an LP problem is always at a corner point of the feasible solution space.
			A)	True
			B)	False
3		As the objective function is moved away from the origin, its value decreases.
			A)	True
			B)	False
4		An LP model consists of constraints and decision variables.
			A)	True
			B)	False
5		Decision variables represent choices available to the decision maker in terms of amounts of inputs or outputs.
			A)	True
			B)	False
6		It is possible to have more than one corner point of the feasible set as an optimum solution to an LP problem.
			A)	True
			B)	False
7		All constraints are either < or > inequalities.
			A)	True
			B)	False
8		The shadow price remains consant in the range of feasibility
			A)	True
			B)	False
9		The range of feasibility is the range of values of the decision variables for which the solution is optimal.
			A)	True
			B)	False
10		A shadow price tells how much a decision variable can be increased or decreased without changing the value of the objective function.
			A)	True
			B)	False
11		The range of optimality gives ranges of values for the objective-function coefficients within which the values of the decision variables are optimal.
			A)	True
			B)	False
12		A binding constraint has zero slack.
			A)	True
			B)	False