Ask a new question
Sign up
Login
Home
Discover Topics
Referral Program
Loans
Flashcards
Upload
Contact us
Topics
Topic
Business
Study-set
Operations Management Study Set 1
Prev
Quiz
Next
Quiz
Operations Management Study Set 1
Business
Quiz 14 :
Sales and Operations Planning
Study Flashcards
Looking for
Management Homework Help?
Unlock Package
Study Flashcards
Unlock Package
Quiz 14 :
Sales and Operations Planning
Prev
Quiz
Next
Quiz
Question Type
All
The area that contains the values that satisfies all the constraints in a linear programming problem is known as the ___ space.
Free
Multiple Choice
Q01
Answer:
Answer:
C
Tags
Add
Choose question tag
Discard
Apply
The constraint 3x
1
+ 6x
2
≥ 48 is converted to an equality by
Free
Multiple Choice
Q02
Answer:
Answer:
B
Tags
Add
Choose question tag
Discard
Apply
Linear programming problems with two decision variables can be solved graphically.
Free
True False
Q03
Answer:
Answer:
True
Tags
Add
Choose question tag
Discard
Apply
Linear programming is a mathematical modelling technique based on linear relationships.
True False
Q04
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
A linear programming model's constraints are nonlinear relationships that describe the restrictions placed on the decision variables.
True False
Q05
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
___ represent a restriction on decision variable values for a linear programming problem.
Multiple Choice
Q06
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
Because linear programming provides an optimal solution, sensitivity analysis is never an important consideration.
True False
Q07
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
The formulation for a linear programming problem cannot include more than one decision variable.
True False
Q08
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
While all linear programming problems have a single objective function, very few, if any, have constraints.
True False
Q09
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
The simplex method used for solving linear programming problems uses matrix algebra to solve simultaneous equations.
True False
Q10
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
The optimal solution for a linear programming problem will always occur at an extreme point.
True False
Q11
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
The feasible solution space contains the values for the decision variables that satisfy the majority of the linear programming model's constraints.
True False
Q12
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
The constraints in a linear programming formulation define the feasible solution space.
True False
Q13
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
A formulation for a linear programming model consists of a decision variable, a constraint, and several objective functions.
True False
Q14
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
Operations managers find very few types of linear program models applicable today because finding an optimal solution is no longer a concern.
True False
Q15
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
The optimal solution for a linear programming problem will always occur
Multiple Choice
Q16
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
The objective function is a linear relationship that either minimizes or maximizes some value.
True False
Q17
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
In general, the objective function for linear programming problems in operations is one of minimizing costs.
True False
Q18
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
Most real-world linear programming problems are solved graphically.
True False
Q19
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
The simplex method is a solution method used for linear programming problems that have
Multiple Choice
Q20
Answer:
Unlock to view answer
Tags
Add
Choose question tag
Discard
Apply
Showing 1 - 20 of 123
Prev
1
...
2
...
3
...
4
...
5
...
6
...
7
...
Next