Sei sulla pagina 1di 12

Online quiz 1

1.
48)
Solve the following graphically:
3x1 + 4x2
Max z =
s.t.

x1 + 2x2 16

2x1 + 3x2 18
x1 2

x2 10

x1, x2 0
What are the optimal value of z?
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.

27
22
24
31
20
22
28
18
17
None of the other choices are correct.

Answer: x1 = 9, x2 = 0, z = 27

Diff: 3 Page Ref: 37-41


Section Heading: Graphical Solutions of Linear Programming Models
Keywords: graphical solution, simultaneous solution
AACSB: Analytical thinking

Q2

51) Consider the following linear program:


MAX
s.t.

Z = 60A + 50B
10A + 20B 200
8A + 5B 80
A2
B5

Solve this linear program graphically and determine the optimal quantities of A, B, and the value of Z.
The optimal value of Z is:
A.
B.
C.
D.
E.
F.
G.
H.
I.
J.

708.7
609.4
700.5
780.7
990.0
567.9
767.5
676.5
672.4
None of the other choices are correct.

Answer: Solution shown below.

Diff: 2 Page Ref: 37-41


Section Heading: Graphical Solutions of Linear Programming Models
Keywords: graphical linear programming
AACSB: Analytical thinking
The above answer from author is not correct.

60*5.45 + 50*7.27 = 327 + 363.5 = 690.5


Ans : J. None of the other choices are correct.

Q3.

52) Consider the following linear program:


MIN
s.t.

Z = 60A + 50B
10A + 20B 200
8A + 5B 80
A2
B5

Solve this linear program graphically and determine the optimal quantities of A, B, and the value of Z.
The optimal value of Z is :
1.
2.
3.

370
420
330

4. 310
5. 110
6. 220
7. 380
8. 300
9. 280
10. None of the other options is correct
Answer: A = 2, B = 5, Z = 370

Diff: 2 Page Ref: 37-41


Section Heading: Graphical Solutions of Linear Programming Models
Keywords: graphical linear programming
AACSB: Analytical thinking

Q4.
74) Which of the following could not be a linear programming problem constraint?
A) 1A + 2B 3
B) 1A + 2B = 3
C) 1A + 2B 3
D) 1A + 2B 3
Answer: A
Diff: 2 Page Ref: 34-35
Section Heading: A Maximization Model Example
Keywords: formulation, constraints
AACSB: Analytical thinking
Q5.

96) Consider the following maximization problem.


MAX z = x + 2y
s.t.
2x + 3y 6
5x + 6y 30
y1
The optimal solution:
A) occurs where x = 4.67 and y = 1.11.
B) occurs where x = 0 and y = 2.
C) occurs where x = 6 and y = 0.
D) results in an objective function value of 12.
Answer: B

Diff: 1 Page Ref: 42


Section Heading: Graphical Solutions of Linear Programming Models
Keywords: graphical solution, extreme points, feasible region
AACSB: Analytical thinking

Q6.
111) How would multiple optimal solutions typically appear on a graphical solution?
A) a point
B) a line
C) a plane
D) a cube
Answer: B
Diff: 2 Page Ref: 55
Section Heading: Irregular Types of Linear Programming Problems
Keywords: graphical solutions, multiple optimal solutions
AACSB: Analytical thinking

Q7,

109) In order for an optimization problem to have multiple optimal solutions:


A) the objective function and one constraint must have the same y-intercept.
B) the objective function and one constraint must have the same slope.
C) two or more of the constraints must not have intersection points.
D) two or more of the constraints must have the same slope.
Answer: B
Diff: 2 Page Ref: 55
Section Heading: Irregular Types of Linear Programming Problems
Keywords: graphical solutions, multiple optimal solutions
AACSB: Analytical thinking
Q8.

118) Consider the following linear program:

MAX z = 5x + 3y
s.t.
x-y6
x 1
The optimal solution:
A) is infeasible.
B) occurs where x = 1 and y = 0.
C) occurs where x = 0 and y = 1.
D) results in an objective function value of 5.
Answer: D,
B also gets full points

Diff: 2 Page Ref: 40


Section Heading: Graphical Solutions of Linear Programming Models
Keywords: slack variables
AACSB: Analytical thinking
Q9.

123) If the feasible region for a linear programming problem is unbounded, then the solution to the
corresponding linear programming problem is ________ unbounded.
A) always
B) sometimes
C) never
D) There is not enough information to complete this statement.
Answer: B
Diff: 3 Page Ref: 56
Section Heading: Irregular Types of Linear Programming Problems
Keywords: irregular types of linear programming problems, unboundedness
AACSB: Analytical thinking

Q10.

16. a) MaximizeZ=23x1+73x2
subjectto
x140
x225
x1+4x2120
x1,x20
WhatistheoptimalvalueofZ?
1.
2.
3.
4.
5.
6.
7.
8.

2380
2470
3426
2330
2360
2040
2030
2010

9. 1890
10. Noneoftheotheroptionsiscorrect
Ans:

Q11.
22. a) MinimizeZ=64x1+42x2(laborcost,$)
subjectto
16x1+12x2450(claims)
x1+x240(workstations)
0.5x1+1.4x225(defectiveclaims)
x1,x20

TheoptimalvalueofZis:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.

Ans:

Noneoftheotheroptionsiscorrect
1835.12
1642.00
1712.28
2030.12
1456.21
1865.32
1976.34
2134.45
0.00

b)

12.
35. a) MaximizeZ=800x1+900x2(profit,$)
subjectto
2x1+4x230
4x1+2x230
x1+x29
x1,x20
TheoptimalvalueofZis:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
b)

8500
7500
6500
5600
7800
9000
9200
6520
8800
Noneoftheotheroptionsiscorrect

Q13.
43. a) MinimizeZ=.09x1+.18x2
subjectto
.46x1+.35x22,000
x11,000
x21,000
.91x1.82x2=3,500
x1,x20
WhatistheoptimalvalueofZ?
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.

Noneoftheotheroptionsiscorrect
200.12
300.09
330.35
440.05
452.01
567.23
312.09
234.45
478.12

Q14.
79) The ________ property of linear programming models indicates that the values of all the model
parameters are known and are assumed to be constant.
A) additive
B) divisibility
C) certainty
D) proportionality
Answer: C
Diff: 2 Page Ref: 57
Section Heading: Characteristics of Linear Programming Problems
Keywords: properties of linear programming models
AACSB: Analytical thinking

Q15.
80) The region that 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.
Answer: B
Diff: 1 Page Ref: 39
Section Heading: Graphical Solutions of Linear Programming Models
Keywords: graphical solution, feasibility
AACSB: Analytical thinking
Q16.

85) The optimal solution to a linear programming model that has been solved using the graphical
approach:
A) is typically located at the origin.
B) must be below and on the left side of all constraint lines.

C) must be above and the right of all constraint lines.


D) is typically at some corner of the feasible region.
Answer: D

Diff: 1 Page Ref: 40


Section Heading: Graphical Solutions of Linear Programming Models
Keywords: solution
AACSB: Analytical thinking

Q17.

112) Which of the following statements about infeasible problems is best?


A) All of the possible solutions violate at least one constraint.
B) All of the possible solutions violate all of the constraints.
C) At least one of the possible solutions violates all of the constraints.
D) At least one of the possible solutions violates at least one of the constraints.
Answer: A
Diff: 1 Page Ref: 56
Section Heading: Irregular Types of Linear Programming Problems
Keywords: infeasible problem, infeasible solution
AACSB: Analytical thinking
Q18.

118) Consider the following linear program:


MAX z = 5x + 3y
s.t.
x-y6
x 1
The optimal solution:
A) is infeasible.
B) occurs where x = 1 and y = 0.
C) occurs where x = 0 and y = 1.
D) results in an objective function value of 5.
Answer: D,
B also gets full points
This is a controversial question from author. We have given full points to all answers. This question is
also a repeat for checking online integrity.
Diff: 2 Page Ref: 40
Section Heading: Graphical Solutions of Linear Programming Models
Keywords: slack variables
AACSB: Analytical thinking

Q19.

121) Multiple optimal solutions provide ________ flexibility to the decision maker.
A) greater
B) less

C) greater or equal
D) less or equal
Answer: A

Diff: 2 Page Ref: 55


Section Heading: Irregular Types of Linear Programming Problems
Keywords: irregular types of linear programming problems
AACSB: Analytical thinking

Q20.

33) The ________ solution area is an area bounded by the constraint equations.
A.
B.
C.
D.

Feasible
Infeasible
Multiple optimal
None of the other options is correct

Answer: feasible

Diff: 1 Page Ref: 39


Section Heading: Graphical Solutions of Linear Programming Models
Keywords: graphical solution
AACSB: Analytical thinking

Potrebbero piacerti anche