Exam 21: Supplement Operational Decision-Making Tools: Linear Programming
Exam 1: Introduction to Operations and Supply Chain Management79 Questions
Exam 2: Supplement Operational Decision-Making Tools: Decision Analysis43 Questions
Exam 3: Quality Management91 Questions
Exam 4: Statistical Process Control103 Questions
Exam 5: Supplement Operational Decision-Making Tools: Acceptance Sampling28 Questions
Exam 6: Product Design86 Questions
Exam 7: Service Design77 Questions
Exam 8: Processes and Technology47 Questions
Exam 9: Capacity and Facilities90 Questions
Exam 10: Supplement Operational Decision-Making Tools: Facility Location Models22 Questions
Exam 11: Human Resources90 Questions
Exam 12: Supplement Operational Decision-Making Tools: Work Measurement26 Questions
Exam 13: Project Management98 Questions
Exam 14: Supply Chain Management Strategy and Design73 Questions
Exam 15: Global Supply Chain Procurement and Distribution86 Questions
Exam 16: Supplement Operational Decision-Making Tools: Transportation and Transshipment Models28 Questions
Exam 17: Forecasting94 Questions
Exam 18: Inventory Management93 Questions
Exam 19: Supplement Operational Decision-Making Tools: Simulation25 Questions
Exam 20: Sales and Operations Planning85 Questions
Exam 21: Supplement Operational Decision-Making Tools: Linear Programming38 Questions
Exam 22: Enterprise Resource Planning92 Questions
Exam 23: Lean Systems86 Questions
Exam 24: Scheduling99 Questions
Select questions type
The area that contains the values that satisfies all the constraints in a linear programming problem is known as the _________________ space.
(Multiple Choice)
4.7/5
(33)
TicToc produces product A and product B.These products have the following resource requirements.
The firm has a weekly production budget of $3000 and a maximum of 1000 hours of labor per week.Each A produced generates $35.00 in profit for the company.Each B produced generates $25.00 in profit for the company.The capacity constraint for labor is

(Multiple Choice)
4.9/5
(33)
In general,the objective function for linear programming problems in operations is one of minimizing costs.
(True/False)
4.8/5
(45)
The simplex method used for solving linear programming problems uses matrix algebra to solve simultaneous equations.
(True/False)
4.8/5
(38)
The objective function is a linear relationship that either minimizes or maximizes some value.
(True/False)
4.7/5
(29)
Atlas Inc.produces product A and product B.Each product must go through two processes.Each A produced requires two hours in process 1 and five hours in process 2.Each B produced requires six hours in process 1 and three hours in process 2.There are 80 hours of capacity available each week in each process.Each A produced generates $6.00 in profit for the company.Each B produced generates $9.00 in profit for the company.If the company produces 6 units of A and 9 units of B the value of the objective function is equal to
(Multiple Choice)
4.9/5
(26)
Operations mangers find very few types of linear program models applicable today because finding an optimal solution is no longer a concern.
(True/False)
4.9/5
(32)
A linear programming model's constraints are nonlinear relationships that describe the restrictions placed on the decision variables.
(True/False)
4.7/5
(44)
The formulation for a linear programming problem cannot include more than one decision variable.
(True/False)
4.9/5
(34)
If a resource has positive slack,then its shadow price is __________.
(Multiple Choice)
4.9/5
(40)
The simplex method is a solution method used for linear programming problems that have
(Multiple Choice)
4.9/5
(25)
For a less than or equal to (<)constraint the shadow price represents the
(Multiple Choice)
4.8/5
(37)
A company produces product A and product B.These products have the following resource requirements.
The firm has a weekly production budget of $5000 and a maximum of 800 hours of labor per week.Each A produced generates $45.00 in profit for the company.Each B produced generates $35.00 in profit for the company.The objective function for this company is represented by

(Multiple Choice)
4.8/5
(31)
Atlas Inc.produces product A and product B.Each product must go through two processes.Each A produced requires two hours in process 1 and five hours in process 2.Each B produced requires six hours in process 1 and three hours in process 2.There are 80 hours of capacity available each week in each process.Each A produced generates $6.00 in profit for the company.Each B produced generates $9.00 in profit for the company.The constraint for process 1 is represented by
(Multiple Choice)
4.9/5
(37)
The feasible solution space contains the values for the decision variables that satisfy the linear programming model's constraints.
(True/False)
4.9/5
(34)
The optimal solution for a linear programming problem will always occur
(Multiple Choice)
4.8/5
(32)
Showing 21 - 38 of 38
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)