Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
0Activity
0 of .
Results for:
No results containing your search query
P. 1
SampleFINAL 205 Taylor Excel

SampleFINAL 205 Taylor Excel

Ratings: (0)|Views: 2|Likes:
Published by askar_cba

More info:

Published by: askar_cba on May 02, 2013
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

05/02/2013

pdf

text

original

 
SAMPLE FINAL EXAM, Management Science (QMIS 205)PLEASE NOTE: Final Exam is Comprehensive .
Students should also review the sampltest for the midterm 
True or False questions
 1.
 
In LP, the objective function always consists of either maximizing or minimizing some value.
2.
 
Parameters are known, constant values that are usually coefficients of variables in equations.
3.
 
Binary variables are best suited to be the decision variables when dealing with yes-or-no decisions.
4.
If a transportation problem has four origins and five destinations, the LP formulation of the problem willhave nine functional (structural) constraints.
 
5.
 
A transportation problem with 3 sources and 4 destinations will have exactly 7 terms in the objectivefunction.
6.
 
In an unbalanced transportation model, all constraints are equalities.
7.
 
Assignment problems are cost minimization problems and cannot be solved as a profit maximization problem.
8.
 
In an assignment problem, every source and every destination has a demand of either 0 or 1.
9.
 
A prohibited route in a transportation model should be assigned an arbitrarily high cost coefficient.
10.
 
A constraint with a ≥ sign in a linear programming model is to restrict th
e usage of a limited resource.
11.
 
To find the optimal solution for an integer programming problem we can solve it as a linear  programming problem and then round the solution.
12.
 
In LP, an infeasible solution violates all of the constraints of the problem.
13.
 
When solving a minimization problem graphically, it is generally the goal to move the objectivefunction line out, away from the origin, as far as possible.
14.
 
In a total integer model, all decision variables have integer solution values.
15.
 
In a mixed integer model, some solution values for decision variables are integer and others can be non
-
integer.
16.
 
When a certain route in a transportation problem does not exist, the problem cannot be formulated as atransportation problem.
17.
 
When the number of people and the number of tasks are not equal in an assignment problem then the problem cannot be solved.
 
18.
 
The president of a company is deciding to choose from among five equally qualified candidates for her vice-president position. If this situation could be modeled as a linear program, the decision variableswould be binary (0
-
1).
19.
 
Sensitivity ranges can be computed only for the right
-
hand sides of constraints.
20.
 
The sensitivity range for an objective function coefficient is the range of values over which the profitdoes not change.
21.
 
The sensitivity range for a constraint quantity value is the range over which the shadow price is valid.
 Multiple Choice
22.
 
In linear programming, solutions that satisfy all of the constraints simultaneously are referred to as:a. optimal. b. feasible.c. nonnegative.d. targeted.e. All of the above.
23.
 
Which objective function has the same slope as this line: 4
 x
+ 2
 y
= 20.a. 2
 x
+4
 y
= 20. b. 2
 x
 
 – 
4
 y
= 20.c. 4
 x
 
 – 
2
 y
= 20.d. 4
 x
+ 2
 y
= 10.e. None of the above.
24.
 
Given the following 2 constraints, which solution is a feasible solution for a maximization problem?(1) 14
 x
1
+ 6
 x
2
 
≤ 42
 (2)
 x
1
 
 – 
 
 x
2
 
≤ 3
 a. (
 x
1
,
 x
2
) = (1,5). b. (
 x
1
,
 x
2
) = (2,1).c. (
 x
1
,
 x
2
) = (4,4).d. (
 x
1
,
 x
2
) = (5,1).e. (
 x
1
,
 x
2
) = (2,6).
25.
 
The assignment problem constraint x
31
+ x
32
+ x
33
+ x
34
< 2 meansa. agent 3 can be assigned to at most 2 tasks. b. agent 2 can be assigned to at least 3 tasks.c. agents 1, 2, 3, and 4 will be assigned to task 3.d. agent 3 will be assigned to at least 2 tasks.
26.
 
Let x
1
, x
2
, and x
3
be binary (0
 – 
1) variables whose values indicate whether the projects are done (x
i
=1)or are not done (x
i
=0). Which answer below indicates that at least two of the projects must be done?a.
 
x
1
+ x
2
+ x
3
> 2 b.
 
x
1
+ x
2
+ x
3
< 2c.
 
x
1
+ x
2
+ x
3
= 2d.
 
x
1
- x
2
= 0
 
 
27.
 
In linear programming, sensitivity (what-if) analysis is associated with determining the effect of changing:I. objective function coefficients.II. right-hand side values of constraints.III. decision variable values.a. I and II b. II and IIIc. I, II, and IIId. I and III
28.
 
In a binary programming problem with 2 alternatives,
 x
1
and
 x
2
, the following constraint needs to beadded to the formulation if the 2 alternatives are mutually exclusive and one of them must be chosen:a.
 x
1
+
 x
2
 
≤ 1.
  b.
 x
1
+
 x
2
= 1.c.
 x
1
-
 x
2
 
≤ 1.
 d.
 x
1
-
 x
2
= 1.
29.
 
In a binary programming problem with 2 alternatives,
 x
1
and
 x
2
, the following constraint needs to beadded to the formulation if the 2 alternatives are mutually exclusive and one of them may be chosen:a.
 x
1
+
 x
2
 
≤ 1.
  b.
 x
1
+
 x
2
= 1.c.
 x
1
-
 x
2
 
≤ 1.
 d.
 x
1
-
 x
2
= 1.
30.
 
The constraint




in a transportation problem implies:a. demand point 1 (customer 1) can demand up to 250 units. b. destination 1 has maximum possible demand.c. supply point 1 (supplier 1) cannot supply more than 250 units.d. customer 1 can get its supplies from 4 suppliers.e. none of the above.
31.
 
Which of the following is true about a balanced transportation model:a.
all demand constraints are ≥.
  b. all constraints are =.c.
all supply constraints are ≤ and all demand constraints are =.
 d. all supply constraints
are ≥.
 e. none of the above.
32.
 
An assignment problem:a. is a special type of transportation problem. b. will always have integer solution.c. has all supplies and demands equal to 1.d. all the decision variables are either 0 or1.e. all of the above.

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->