Operations Management Midterm #1

अब Quizwiz के साथ अपने होमवर्क और परीक्षाओं को एस करें!

T/F: A minimization model of a linear programming contains only surplus variables.

F

T/F: A variable is a value that is usually a coefficient of a parameter in an equation.

F

T/F: First step in formulating a linear programming model is define the objective function.

F

T/F: For a profit maximization problem, if the allowable increase for a coefficient in the objective function is infinite, then profits are unbounded.

F

T/F: Graphical solutions to linear programming problems have a finite number of possible objective function lines.

F

T/F: If the objective function is parallel to a constraint, the constraint is infeasible.

F

T/F: If variable costs increase, but price and fixed costs are held constant, break-even will decrease.

F

T/F: In both an objective function and constraint, the decision variables are represented by numbers.

F

T/F: In general, an increase in price increases the break-even point if all costs are held constant.

F

T/F: Linear programming problems can model decreasing marginal returns.

F

T/F: Management science modeling techniques provide results that are known with certainty.

F

T/F: Management science techniques focus primarily on observation, model construction, and implementation to find an appropriate solution to a problem.

F

T/F: Most computer linear programming packages readily accept constraints entered in fractional form, such as X1/X3.

F

T/F: Multiple optimal solutions exist when constraints are parallel to each other.

F

T/F: Objective functions in linear programs always minimize costs.

F

T/F: Proportionality means the slope of a constraint is proportional to the slope of the objective function.

F

T/F: Sensitivity analysis can be used to determine the effect on the solution for changing several parameters at once.

F

T/F: Sensitivity ranges can be computed only for the right hand sides of constraints.

F

T/F: Surplus variables are only associated with minimization problems

F

T/F: The equation 8xy=32 satisfies the proportionality property of linear programming.

F

T/F: The first step of the management science process is to define the problem.

F

T/F: The following equation represents a resource constraint for a maximization problem: X + Y >= 20.

F

T/F: The optimal solution for a graphical linear programming problem is the corner point farthest from the origin.

F

T/F: The sensitivity range for a constraint quantity value is the range over which the optimal vales of the decision variables do not change.

F

T/F: The sensitivity range for an objective function coefficient is the range of values over which the profit does not change.

F

T/F: The term big data refers to numbers of large magnitude, greater than or equal to one billion.

F

T/F: The terms in the objective function or constraints are multiplicative.

F

T/F: There is exactly one optimal solution point to a linear program.

F

T/F: Typically, finding a corner point for the feasible region involves solving a set of three simultaneous equations.

F

T/F: When the right-hand sides of two constraints are both increased by one unit, the value of the objective function will be adjusted by the sum of the constraints' prices.

F

T/F: A constraint is a linear relationship representing a restriction on decision making.

T

T/F: A key component of business analytics is the recent availability of large amounts of data.

T

T/F: A linear programming problem requires a choice between alternative courses of function.

T

T/F: A management science solution can be either a recommend or information that helps a manager make a decision.

T

T/F: A management science technique usually applies to a specific model type.

T

T/F: A model is a mathematical representation of a problem situation including variables, parameters, and equations.

T

T/F: All linear programming models exhibit a set of constraints.

T

T/F: Business analytics brings together the disciplines of information systems, management science, statistics, and mathematical modeling.

T

T/F: Constraints usually appear as equations that are less than, equal to, or greater than a parameter.

T

T/F: Data are pieces of information from the problem environment.

T

T/F: Fixed costs is the difference between total cost and total variable cost.

T

T/F: If we change the constraint quantity to a value outside the sensitivity range for that constraint quantity, the shadow price will change.

T

T/F: In the graphical approach, simultaneous equations can be used to solve for the optimal solution.

T

T/F: Linear programming is a model consisting of linear relationship representing a firm's decisions given an objective function and resource constraints.

T

T/F: Linear programming models exhibit linearity among all constraint relationships and the objective function.

T

T/F: Management science modeling techniques focus on model construction and problem solution.

T

T/F: Managers utilize spreadsheets to conduct their own analyses in management science studies.

T

T/F: Parameters are known, constant values that are usually coefficients of variables in equations.

T

T/F: Sensitivity analysis allows the modeler to relax the certainty assumption;.

T

T/F: Sensitivity analysis determines how a change in a parameter affects the optimal solution.

T

T/F: The break-even point is the volume that equates total revenue with total costs.

T

T/F: The feasible solution area contains infinite solutions to the linear programming.

T

T/F: The marginal value of any scarce resource is the dollar amount one should be willing to pay for one additional unit of that scarce resource.

T

T/F: The objective function always consists of either maximizing or minimizing some value.

T

T/F: The objective function is a linear relationship reflecting the objective of an operation.

T

T/F: The sensitivity range for a constraint quantity value is the range over which the shadow price is value.

T

T/F: The sensitivity range for an objective function coefficient is the range of values over which the current optimal solution point (product mix) will remain optimal.

T

T/F: The shadow price for a positive decision variable is 0.

T

T/F: The term continuous is synonymous with divisible in the context of linear programming.

T

T/F: The term sensitivity analysis refers to testing how a problem solution reacts to changes in one or more model parameters.

T

T/F: The terms in the objective function or constraints are additive.

T

T/F: The terms shadow price and dual price mean the same thing.

T

T/F: Variable costs depend on the number of items produced.

T

T/F: When using the graphical method, only one or four of the quadrants of an xy-axis needs to be drawn.

T

The sensitivity range for a __________ coefficient is the range of values over which the current optimal solution point (product mix) will remain optimal.

objective function

T/F: the analysis of the effect of parameter changes on the optimal solution

sensitivity analysis

T/F: The sensitivity range for a constraint quantity value is also the range over which the _______ _______ is valid.

shadow price

T/F: The reduced cost (shadow price) for a positive decision variable is...

zero


संबंधित स्टडी सेट्स

HHA PrepU: Chapter 27 Female Genitalia

View Set

Lewis MedSurg Ch. 29 NCLEX, SG: Chap 29 - Obstructive Pulmonary Disease, Chapter 28: Obstructive pulmonary diseases, Chapter 28: Obstructive Pulmonary Diseases

View Set

Lewis Chapter 25: Burns, CH 57 BURNS, Chapter 46: Burns: Nursing Management, Medical Surgical Nursing Chapter 12 Inflammation and Wound Healing, Lewis Ch. 22 - Assessment of Integumentary System, Lewis 10th Chapter 22 Assessment of Integumentary Syst...

View Set

Chapter 26: Growth and Development of the Toddler - ML6

View Set

Macroeconomics-Chapter 8-Unemployment & Inflation

View Set