COMM 225 TEST BANK SUPLEMENT C COMPLETE QUESTIONS AND WELL EXPLAINED ANSWERS CONCORDIA UNIVERSITY 2024
17 vues 0 fois vendu
Cours
COMM 225
Établissement
Concordia University (
)
COMM 225 TEST BANK SUPLEMENT C COMPLETE QUESTIONS AND WELL EXPLAINED ANSWERS CONCORDIA UNIVERSITY 2024
19) In which of the following has LP been applied successfully?
A) minimizing distance traveled by school buses carrying children
B) minimizing 911 response time for police patrols
C) minimizi...
COMM 225 TEST BANK SUPLEMENT C COMPLETE QUESTIONS AND WELL
EXPLAINED ANSWERS CONCORDIA UNIVERSITY 2024
19) In which of the following has LP been applied successfully?
A) minimizing distance traveled by school buses carrying children
B) minimizing 911 response time for police patrols
C) minimizing labor costs for bank tellers while maintaining service levels
D) determining the distribution system for multiple warehouses to multiple destinations
E) all of the above
Answer: E
Diff: 1
Topic: Why use linear programming?
Objective: no LO
,20) Which of the following represents valid constraints in linear programming?
A) 2X ≥ 7X*Y
B) 2X * 7Y ≥ 500
C) 2X + 7Y ≥100
D) 2X2 + 7Y ≥ 50
E) All of the above are valid linear programming constraints.
Answer: C
Diff: 2
Topic: Requirements of a linear programming problem
Objective: no LO
21) Which of the following is not a requirement of a linear programming problem?
A) an objective function, expressed in terms of linear equations
B) constraint equations, expressed as linear equations
C) an objective function, to be maximized or minimized
D) alternative courses of action
E) for each decision variable, there must be one constraint or resource
limit Answer: E
Diff: 2
Topic: Requirements of a linear programming problem
Objective: no LO
22) In linear programming, a statement such as "maximize contribution" becomes a(n)
A) constraint
B) slack variable
C) objective function
D) violation of linearity
E) decision variable
Answer: C
Diff: 2
Topic: Formulating linear programming problems
Objective: LO-Module B-1
23) If cars sell for $500 profit and trucks sell for $300 profit which of the following represents the
objective function?
A) Maximize = 500C+300T
B) Minimize = 500C + 300T
C) Maximize = 500C — 300T
D) Minimize = 300T- 500C
E) None of the
above Answer: A
Diff: 2
Topic: Formulating linear programming problems
Objective: LO-Module B-1
34) What combination of x and y will yield the optimum for this problem?
Maximize $3x + $15y, subject to (1) 2x + 4y < 12 and (2) 5x + 2y < 10.
A) x = 2, y = 0
B) x = 0, y = 3
,C) x = 0, y = 0
D) x = 1, y = 5
E) none of the
above Answer: B
Diff: 2
Topic: Graphical solution to a linear programming problem
AACSB: Analytic Skills
Objective: LO-Module B-3
35) What combination of x and y will yield the optimum for this problem?
Minimize $3x + $15y, subject to (1) 2x + 4y < 12 and (2) 5x + 2y < 10.
A) x = 2, y = 0
B) x = 0, y = 3
C) x = 0, y = 0
D) x = 1, y = 5
E) none of the
above Answer: C
Diff: 2
Topic: Graphical solution to a linear programming problem
AACSB: Analytic Skills
Objective: LO-Module B-3
36) What combination of a and b will yield the optimum for this problem?
Maximize $6a + $15b, subject to (1) 4a + 2b < 12 and (2) 5a + 2b < 20.
A) a = 0, b = 0
B) a = 3, b = 3
C) a = 0, b = 6
D) a = 6, b = 0
E) cannot solve without values for a and b
Answer: C
Diff: 2
Topic: Graphical solution to a linear programming problem
AACSB: Analytic Skills
Objective: LO-Module B-3
41) A linear programming problem contains a restriction that reads "the quantity of X must be at least
three times as large as the quantity of Y." Which of the following inequalities is the proper formulation
of this constraint?
A) 3X ≥ Y
B) X ≤ 3Y
C) X + Y≥3
D) X - 3Y ≥ 0
E) 3X ≤ Y
Answer: D
Diff: 2
Topic: Formulating linear programming problems
AACSB: Analytic Skills
Objective: LO-Module B-1
42) A linear programming problem contains a restriction that reads "the quantity of Q must be no larger
, than the sum of R, S, and T." Formulate this as a constraint ready for use in problem solving software.
A) Q + R + S + T ≤ 4
B) Q ≥ R + S + T
C) Q - R - S - T ≤ 0
D) Q / (R + S + T) ≤ 0
E) none of the
above Answer: C
Diff: 2
Topic: Formulating linear programming problems
AACSB: Analytic Skills
Objective: LO-Module B-1
43) A linear programming problem contains a restriction that reads "the quantity of S must be no less
than one-fourth as large as T and U combined." Formulate this as a constraint ready for use in
problem solving software.
A) S / (T + U) ≥ 4
B) S - .25T -.25U ≥ 0
C) 4S ≤ T + U
D) S ≥ 4T / 4U
E) none of the
above Answer: B
Diff: 2
Topic: Formulating linear programming problems
AACSB: Analytic Skills
Objective: LO-Module B-1
Les avantages d'acheter des résumés chez Stuvia:
Qualité garantie par les avis des clients
Les clients de Stuvia ont évalués plus de 700 000 résumés. C'est comme ça que vous savez que vous achetez les meilleurs documents.
L’achat facile et rapide
Vous pouvez payer rapidement avec iDeal, carte de crédit ou Stuvia-crédit pour les résumés. Il n'y a pas d'adhésion nécessaire.
Focus sur l’essentiel
Vos camarades écrivent eux-mêmes les notes d’étude, c’est pourquoi les documents sont toujours fiables et à jour. Cela garantit que vous arrivez rapidement au coeur du matériel.
Foire aux questions
Qu'est-ce que j'obtiens en achetant ce document ?
Vous obtenez un PDF, disponible immédiatement après votre achat. Le document acheté est accessible à tout moment, n'importe où et indéfiniment via votre profil.
Garantie de remboursement : comment ça marche ?
Notre garantie de satisfaction garantit que vous trouverez toujours un document d'étude qui vous convient. Vous remplissez un formulaire et notre équipe du service client s'occupe du reste.
Auprès de qui est-ce que j'achète ce résumé ?
Stuvia est une place de marché. Alors, vous n'achetez donc pas ce document chez nous, mais auprès du vendeur smartzone. Stuvia facilite les paiements au vendeur.
Est-ce que j'aurai un abonnement?
Non, vous n'achetez ce résumé que pour €13,41. Vous n'êtes lié à rien après votre achat.
