Chapter 6 Homework Questions – Linear Programming Modeling

True/False

Indicate whether the sentence or statement is true or false.

______	1.	A linear programming model consists of decision variables, constraints, but no objective function.
______	2.	Linear programming models exhibit linearity among all constraint relationships and the objective function.

______	3.	Linear programming models have an objective function to be maximized but not minimized.

______	4.	In a linear programming model, the numberof constraints must be less than the number of decision variables.

______	5.	Linear programming is a model consisting of linear relationships representing a firm’s decisions given an objective and resource constraints.

BEGIN

Multiple Choice

Identify the letter of the choice that best completes the statement or answers the question.

______	6.	The second step in solving a graphical linear programming model is
a.	plot the slack variables 	
b.	plot the objective function and move this line out from the origin to locate the optimal solution point	
c.	solve simultaneous equations at each corner point to find the solution values at each point	
	plot the model constraints as equations on the graph and indicate the feasible solution area	
d.	none of the above	

______	7.	The optimal solution of a minimization problem is at the extreme point ___________ the origin.
a.	farthest from	
b.	closest to	
c.	exactly at	
d.	none of the above	

______	8.	The optimal solution is the ________ feasible solution.
a.	best	
b.	only	
c.	worst	
d.	none of the above	

______	9.	The region which satisfies all of the constraints in a graphical linear programming problem is called the
a.	region of optimality	
b.	feasible solution space	
c.	region of non-negativity	
d.	optimal solution space	

______	10.	A linear programming model consists of
a.	decision variables.	
b.	an objective function.	
c.	constraints.	
d.	all of the above.