Management science techniques focus primarily on observation, model construction and implementation to find an appropriate solution to a problem.
In linear programming problems, multiple optimal solutions occur when constraints are parallel to each other.
A change in the value of an objective function coefficient will always change the value of the optimal solution.
Fractional relationships between variables are not permitted in the standard form of a linear program.
In a total integer model, all decision variables have integer solution values.
In a transshipment problem, items may be transported from destination to destination and from source to source.
The events in an experiment are mutually exclusive if only one can occur at a time.
The minimax criterion minimizes the maximum payoff.
Excel can be used to simulate systems that can be represented by both discrete and continuous random variables.
Adjusted exponential smoothing is an exponential smoothing forecast adjusted for seasonality.
Which of the following is an equation or an inequality that expresses a resource restriction in a mathematical model?
If the price decreases but fixed and variable costs do not change, the break even point:
A slack variable:
Cully furniture buys 2 products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75000 to invest in shelves this week, and the warehouse has 18000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. What is the storage space constraint?
The following is an Excel “Answer” and “Sensitivity” reports of a linear programming problem:
The Answer Report:
The Sensitivity Report:
Which additional resources would you recommend to be increased?
Given the following linear programming problem that minimizes cost.
Min Z = 2x + 8y
Subject to 8x + 4y ≥ 64
2x + 4y ≥ 32
y ≥ 2
What is the sensitivity range for the third constraint, y ≥ 2?
Compared to blending and product mix problems, transportation problems are unique because:
The owner of Black Angus Ranch is trying to determine the correct mix of two types of beef feed, A and B which cost 50 cents and 75 cents per pound, respectively. Five essential ingredients are contained in the feed, shown in the table below. The table also shows the minimum daily requirements of each ingredient.
|Ingredient||Percent per pound in Feed A||Percent per pound in Feed B||Minimum daily requirement (pounds)|
The constraint for ingredient 3 is:
The Wiethoff Company has a contract to produce garden hoses for a customer. Wiethoff has 4 different machines that can produce this kind of hose. Write a constraint to ensure that if machine 4 is used, machine 1 will not be used.
If we are solving a 0-1 integer programming problem, the constraint x1 = x2 is a __________ constraint.
The following table represents the cost to ship from Distribution Center 1, 2, or 3 to Customer A, B, or C.
The constraint that represents the quantity demanded by Customer B is:
A professor needs help from 3 student helpers to complete 4 tasks. The first task is grading; the second is scanning; the third is copying, and the fourth is organizing student portfolios. The estimated time for each student to do each task is given in the matrix below.
Which of the following constraints represents the assignment for student A?
Mutually exclusive events are:
Jim is considering pursuing an MS in Information Systems degree. He has applied to two different universities. The acceptance rate for applicants with similar qualifications is 20% for University X and 45% for University Y. What is the probability that Jim will not be accepted at either university?
Determining the worst payoff for each alternative and choosing the alternative with the best worst is called :
A business owner is trying to decide whether to buy, rent, or lease office space and has constructed the following payoff table based on whether business is brisk or slow.