Explore BrainMass
Share

# Operations Management MCQs

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

What is the value of the improvement index for cell B1 shown in Table 10-1?
a. -50
b. +3
c. +2
d. +1

11.36 In a goal programming problem with two goals at the same priority level, all the deviational variables are equal to zero in the optimal solution. This means
a. there is no feasible solution to the problem.
b. all goals are fully achieved.
c. nonlinear programming must be used to solve this.
d. this problem was an integer programming problem.

An integer programming (maximization) problem was first solved as a linear programming problem, and the objective function value (profit) was \$253.67. The two decision variables (X, Y) in the problem had values of X = 12.45 and Y = 32.75. If there is a single optimal solution, which of the following must be true for the optimal integer solution to this problem?
a. X = 12 Y = 32
b. X = 12 Y = 33
c. the objective function value must be less than \$253.67
d. the objective function value will be greater than \$253.67

A company must assign mechanics to each of four jobs. The time involved varies according to individual abilities. Table 10-2 shows how many minutes it takes each mechanic to perform each job. This was solved using the Hungarian method. Table 10-3 shows the solution.

TABLE 10-2
JOB
1 2 3 4
WORKER A 4 6 5 4
B 3 5 4 7
C 5 6 5 4
D 7 5 5 6
TABLE 10-3
JOB
FINAL TABLE 1 2 3 4
WORKER A 0 1 0 0
B 0 1 0 4
C 1 1 0 0
D 3 0 0 2

According to Table 10-3, which is the final table for an assignment problem, which worker should be assigned to Job 1?

a. either worker A or worker B
b. only worker A could be assigned to Job 1
c. only worker B could be assigned to Job 1
d. any of the workers

A company must assign mechanics to each of four jobs. The time involved varies according to individual abilities. Table 10-2 shows how many minutes it takes each mechanic to perform each job. This was solved using the Hungarian method. Table 10-3 shows the solution.
TABLE 10-2
JOB
1 2 3 4
WORKER A 4 6 5 4
B 3 5 4 7
C 5 6 5 4
D 7 5 5 6
TABLE 10-3
JOB
FINAL TABLE 1 2 3 4
WORKER A 0 1 0 0
B 0 1 0 4
C 1 1 0 0
D 3 0 0 2

If optimal assignments are made, how many total minutes are needed to complete the jobs?

a. 0
b. 4
c. 17
d. 20

Assignment problems solved previously by linear programming techniques are also examples of
a. pure-integer programming problems.
b. mixed-integer programming problems.
c. zero-one integer programming problems.
d. goal programming problems.

What is the total cost represented by the solution shown in Table 10-1?
a. 60
b. 2500
c. 2600
d. 500