NEW
Font size
WorksheetsOPERES2 QUIZ_Review of OPERES 1
Total questions: 10
Worksheet time: 5mins
The region which satisfies all of the constraints in graphical linear programming is called the:
lower left hand quadrant
feasible solution space
optimum solution space
region of optimality
The theoretical limit on the number of decision variables that can be handled by the simplex method in a single problem is:
1
2
3
unlimited
Which of the following is not a component of the structure of a linear programming model?
Constraints
Decision variables
Environmental uncertainty
A goal or objective
In a transportation problem with three locations and two destinations, the objective function is as follows: Min 20X11 + 18X21 + 23 X31 + 16X12 + 14X22 + 12X32. How much does it cost to ship one unit from location 2 to destination 1?
18
12
23
16
Which of the following is not information needed to use the transportation model?
capacity of the sources
unit shipping distances
demand of the destinations
all of the above are necessary
In a task assignment situation, in how many different ways can five jobs be assigned to five machines?
5
25
120
3125
A transportation problem has 8 origins and 6 destinations. The optimal solution of this problem will fill no more than _______ cells with quantities to be shipped.
2
13
14
48
A constraint that does not form a unique boundary of the feasible solution space is a:
redundant constraint
binding constraint
non-binding constraint
feasible solution constraint
In linear programming, sensitivity analysis is associated with:
(I) objective function coefficient
(II) right-hand side values of constraints
(III) constraint coefficient
I and II
II and III
I, II and III
I and III
What combination of x and y will provide a minimum for this problem?
x = 0, y = 0
x = 0, y = 3
x = 0, y = 5
x = 6, y = 0
