Exam 17: the Simplex Solution Method
Exam 1: Management Science121 Questions
Exam 2: Linear Programming: Model Formulation and Graphical Solution122 Questions
Exam 3: Linear Programming: Computer Solution and Sensitivity Analysis95 Questions
Exam 4: Linear Programming: Modeling Examples90 Questions
Exam 5: Integer Programming107 Questions
Exam 6: Transportation, Transshipment, and Assignment Problems98 Questions
Exam 7: Network Flow Models104 Questions
Exam 8: Project Management116 Questions
Exam 9: Multicriteria Decision Making103 Questions
Exam 10: Nonlinear Programming72 Questions
Exam 11: Probability and Statistics152 Questions
Exam 12: Decision Analysis122 Questions
Exam 13: Queuing Analysis123 Questions
Exam 14: Simulation100 Questions
Exam 15: Forecasting133 Questions
Exam 16: Inventory Management157 Questions
Exam 17: the Simplex Solution Method90 Questions
Exam 18: Transportation and Assignment Solution Methods86 Questions
Exam 19: Integer Programming: the Branch and Bound Method63 Questions
Exam 20: Nonlinear Programming: Solution Techniques55 Questions
Exam 21: Game Theory64 Questions
Exam 22: Markov Analysis64 Questions
Select questions type
The theoretical limit on the number of decision variables that can be handled by the simplex method is 50.
(True/False)
4.9/5
(30)
At the initial basic feasible solution at the origin, only slack variables have a value greater than zero.
(True/False)
4.8/5
(27)
For a maximization linear programming problem, a(n) ________ is ________ for a less-than-or-equal-to constraint.
(Multiple Choice)
4.8/5
(41)
Given the following linear programming problem:
maximize =\ 100+80 subject to +2\leq40 3+\leq60 ,\geq0
Using the simplex method, what is the optimal value for X2?
(Short Answer)
4.8/5
(44)
The simplex method moves from one better solution to another until the best one is found, and then it stops.
(True/False)
4.8/5
(33)
________ variables are added to constraints and represent unused resources.
(Short Answer)
4.8/5
(35)
In using the simplex method, the number of basic variables is equal to the number of constraints.
(True/False)
4.7/5
(35)
In the simplex method, the model is put into the form of a table, and then a number of mathematical steps are performed on the table.
(True/False)
4.7/5
(34)
The linear programming problem whose output follows determines how many red nail polishes, blue nail polishes, green nail polishes, and pink nail polishes a beauty salon should stock. The objective function measures profit; it is assumed that every piece stocked will be sold. Constraint 1 measures display space in units, constraint 2 measures time to set up the display in minutes. Constraints 3 and 4 are marketing restrictions.
MAX 100x1 + 120x2 + 150x3 + 125x4
Subject to 1. x1 + 2x2 + 2x3 + 2x4 ? 108
2. 3x1 + 5x2 + x4 ? 120
3. x1 + x3 ? 25
4. x2 + x3 + x4 > 50
x1, x2, x3, x4 ? 0
Optimal Solution:
Objective Function Value = 7475.000
Variable Value Reduced Costs X1 8 0 X2 0 5 X3 17 0 X4 33 0
Constraint Slack/Surplus Dual Prices 1 0 75 2 63 0 3 0 25 4 0 -25 Objective Coefficient Ranges
Variable Lower Limit Current Value Upper Limit X1 87.5 100 none X2 none 120 125 X3 125 150 162 X4 120 125 150 Right Hand Side Ranges
Constraint Lower Limit Current Value Upper Limit 1 100 108 123.75 2 57 120 none 3 8 25 58 4 41.5 50 54
-To what value can the profit on red nail polish drop before the solution would change?
(Short Answer)
4.8/5
(29)
Slack variables are added to ________ constraints and represent unused resources.
(Multiple Choice)
4.9/5
(41)
Showing 81 - 90 of 90
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)