QMB 3602 - Final Exam Study Guide Questions With
Correct Answers
In |a |linear |programming |problem, |the |data |cells |do |which |of |the |following?
Provides |important |information |about |the |availability |of |resource.
In |a |linear |programming |problem, |the |changing |cells |do |which |of |the |following?
Contains |the |decisions |made |about |levels |of |activity.
In |a |linear |programming |problem, |the |output |cells |do |which |of |the |following?
Ensures |that |usage |of |resources |does |not |exceed |available |supply.
In |a |linear |programming |problem, |the |objective |cell |does |which |of |the |following?
Measures |the |performance |of |candidate |solution.
The |key |identifying |feature |of |a |resource-allocation |problem |is |which |of |the |following?
I. |Constraints |with |the |form |"Amount |of |resource |used |≥ |Amount |of |resource |available".
II. |Constraints |with |the |form |"Amount |of |resource |used |≤ |Amount |of |resource |available".
III. |Constraints |with |the |form |"Level |achieved |≥ |Minimum |acceptable |level".
IV. |All |constraints |have |the |form |"Amount |provided |= |Required |amount".
,II |only
Constraints |with |the |form |"Amount |of |resource |used |≤ |Amount |of |resource |available".
The |key |identifying |feature |of |a |cost-benefit |trade-off |problem |is |which |of |the |following?
I. |Constraints |with |the |form |"Amount |of |resource |used |≥ |Amount |of |resource |available".
II. |Constraints |with |the |form |"Amount |of |resource |used |≤ |Amount |of |resource |available".
III. |Constraints |with |the |form |"Level |achieved |≥ |Minimum |acceptable |level".
IV. |All |constraints |have |the |form |"Amount |provided |= |Required |amount".
III |only
Constraints |with |the |form |"Level |achieved |≥ |Minimum |acceptable |level".
The |key |identifying |feature |of |a |fixed-requirements |problem |is |which |of |the |following?
I. |Constraints |with |the |form |"Amount |of |resource |used |≥ |Amount |of |resource |available".
II. |Constraints |with |the |form |"Amount |of |resource |used |≤ |Amount |of |resource |available".
III. |Constraints |with |the |form |"Level |achieved |≥ |Minimum |acceptable |level".
IV. |All |constraints |have |the |form |"Amount |provided |= |Required |amount".
IV |only
All |constraints |have |the |form |"Amount |provided |= |Required |amount".
,The |key |identifying |feature |of |a |mixed |problem |is |which |of |the |following?
I. |Constraints |with |the |form |"Amount |of |resource |used |≥ |Amount |of |resource |available".
II. |Constraints |with |the |form |"Amount |of |resource |used |≤ |Amount |of |resource |available".
III. |Constraints |with |the |form |"Level |achieved |≥ |Minimum |acceptable |level".
IV. |All |constraints |have |the |form |"Amount |provided |= |Required |amount".
At |least |two |of |II, |III, |and |IV.
Transportation |problems |can |be |classified |as |which |type |of |linear |programming |problem?
I. |Resource-allocation |problems.
II. |Cost-benefit-tradeoff |problems.
III. |Fixed-requirement |problems.
III |only
Assignment |problems |can |be |classified |as |which |type |of |linear |programming |problem?
I. |Resource-allocation |problems.
II. |Cost-benefit-tradeoff |problems.
III. |Fixed-requirement |problems.
III |only
, A |plumbing |repair |company |has |2 |employees |and |must |choose |which |of |2 |jobs |to |assign |each |
to |(each |employee |is |assigned |to |exactly |one |job |and |each |job |must |have |someone |assigned).
A. |How |many |decision |variables |will |the |linear |programming |model |include?
B. |How |many |fixed |requirement |constraints |will |the |linear |programming |model |include?
A. |How |many |decision |variables |will |the |linear |programming |model |include?
2 | X | 2 |= | 4
Reason: |As |the |2 |employees |may |be |assigned |to |any |of |the |2 |Jobs, |the |total |number |of |
decision |variables |will |be |multiple |of |both |jobs |and |employees
B. |How |many |fixed |requirement |constraints |will |the |linear |programming |model |include?
2 |+ |2 |= |4
Reason: |For |each |job |and |each |employee |sum |will |be |equal |to |1
Which |of |the |following |represents |the |marginal |gain |in |the |objective |value |that |would |occur |if |
one |more |unit |of |a |resource |were |added?
Shadow |Price
Correct Answers
In |a |linear |programming |problem, |the |data |cells |do |which |of |the |following?
Provides |important |information |about |the |availability |of |resource.
In |a |linear |programming |problem, |the |changing |cells |do |which |of |the |following?
Contains |the |decisions |made |about |levels |of |activity.
In |a |linear |programming |problem, |the |output |cells |do |which |of |the |following?
Ensures |that |usage |of |resources |does |not |exceed |available |supply.
In |a |linear |programming |problem, |the |objective |cell |does |which |of |the |following?
Measures |the |performance |of |candidate |solution.
The |key |identifying |feature |of |a |resource-allocation |problem |is |which |of |the |following?
I. |Constraints |with |the |form |"Amount |of |resource |used |≥ |Amount |of |resource |available".
II. |Constraints |with |the |form |"Amount |of |resource |used |≤ |Amount |of |resource |available".
III. |Constraints |with |the |form |"Level |achieved |≥ |Minimum |acceptable |level".
IV. |All |constraints |have |the |form |"Amount |provided |= |Required |amount".
,II |only
Constraints |with |the |form |"Amount |of |resource |used |≤ |Amount |of |resource |available".
The |key |identifying |feature |of |a |cost-benefit |trade-off |problem |is |which |of |the |following?
I. |Constraints |with |the |form |"Amount |of |resource |used |≥ |Amount |of |resource |available".
II. |Constraints |with |the |form |"Amount |of |resource |used |≤ |Amount |of |resource |available".
III. |Constraints |with |the |form |"Level |achieved |≥ |Minimum |acceptable |level".
IV. |All |constraints |have |the |form |"Amount |provided |= |Required |amount".
III |only
Constraints |with |the |form |"Level |achieved |≥ |Minimum |acceptable |level".
The |key |identifying |feature |of |a |fixed-requirements |problem |is |which |of |the |following?
I. |Constraints |with |the |form |"Amount |of |resource |used |≥ |Amount |of |resource |available".
II. |Constraints |with |the |form |"Amount |of |resource |used |≤ |Amount |of |resource |available".
III. |Constraints |with |the |form |"Level |achieved |≥ |Minimum |acceptable |level".
IV. |All |constraints |have |the |form |"Amount |provided |= |Required |amount".
IV |only
All |constraints |have |the |form |"Amount |provided |= |Required |amount".
,The |key |identifying |feature |of |a |mixed |problem |is |which |of |the |following?
I. |Constraints |with |the |form |"Amount |of |resource |used |≥ |Amount |of |resource |available".
II. |Constraints |with |the |form |"Amount |of |resource |used |≤ |Amount |of |resource |available".
III. |Constraints |with |the |form |"Level |achieved |≥ |Minimum |acceptable |level".
IV. |All |constraints |have |the |form |"Amount |provided |= |Required |amount".
At |least |two |of |II, |III, |and |IV.
Transportation |problems |can |be |classified |as |which |type |of |linear |programming |problem?
I. |Resource-allocation |problems.
II. |Cost-benefit-tradeoff |problems.
III. |Fixed-requirement |problems.
III |only
Assignment |problems |can |be |classified |as |which |type |of |linear |programming |problem?
I. |Resource-allocation |problems.
II. |Cost-benefit-tradeoff |problems.
III. |Fixed-requirement |problems.
III |only
, A |plumbing |repair |company |has |2 |employees |and |must |choose |which |of |2 |jobs |to |assign |each |
to |(each |employee |is |assigned |to |exactly |one |job |and |each |job |must |have |someone |assigned).
A. |How |many |decision |variables |will |the |linear |programming |model |include?
B. |How |many |fixed |requirement |constraints |will |the |linear |programming |model |include?
A. |How |many |decision |variables |will |the |linear |programming |model |include?
2 | X | 2 |= | 4
Reason: |As |the |2 |employees |may |be |assigned |to |any |of |the |2 |Jobs, |the |total |number |of |
decision |variables |will |be |multiple |of |both |jobs |and |employees
B. |How |many |fixed |requirement |constraints |will |the |linear |programming |model |include?
2 |+ |2 |= |4
Reason: |For |each |job |and |each |employee |sum |will |be |equal |to |1
Which |of |the |following |represents |the |marginal |gain |in |the |objective |value |that |would |occur |if |
one |more |unit |of |a |resource |were |added?
Shadow |Price
