Test
BUAL
Este test tiene tiempo límite, así que se abre en el reproductor de siempre.
Preguntas del test (66)
1The divisibility property of linear programming means that a solution can have both:
- Ainteger and noninteger levels of an activity
- Blinear and nonlinear relationships
- Cpositive and negative values
- Drevenue and cost information in the model
2In an optimization model, there can only be one:
- Adecision variable
- Bconstraint
- Cobjective function
- Dshadow price
3In linear programming, sensitivity analysis involves examining how sensitive the optimal solution is to changes in:
- Aprofit of variables in the model
- Bcost of variables in the model
- Cresources available
- DAll of these options
4When using the graphical solution method to solve linear programming problems, the set of points that satisfy all constraints is called the:
- Aoptimal region
- Bfeasible region
- Cconstrained region
- Dlogical region
5If a manufacturing process takes 3 hours per unit of x and 5 hours per unit of y and a maximum of 100 hours of manufacturing process time are available, then an algebraic formulation of this constraint is:
- A3x + 5y <= 100
- B3x + 5y < 100
- C3x + 5y > 100
- D3x + 5y >= 100
6A typical transportation problem requires which of the following sets of input numbers:
- ACapacities, demands, and flows
- BCapacities, demands and unit shipping costs
- CSupplies, demands, and flows
- DSupplies, demands, and arcs
7A linear programming problem with only decision variable(s) can be solved by a graphical solution method.
- A1
- B2
- C3
- D4
8One of the things that you can do with linear programming and a spreadsheet model is to develop a user interface to make it easier for someone who is not an expert in using linear programming. The output can be a report that explains the optimal policy in non-technical terms. The type of system being described is called a (n):
- Adecision support system
- Bexpert system
- Clinear programming support system
- Dproduction planning system
9In most cases in solving linear programming problems, we want the decision variables to be:
- Aequal to zero
- Bnonnegative
- Cnonpositive
- DAll of these options
10Any integer program involving 0 – 1 variable with constraint(s) is called a knapsack problem.
- Athree
- Btwo
- Cone
- Dzero
11The objective in transportation problems is typically to:
- Amaximize profits
- Bmaximize revenue
- Cminimize costs
- Dmaximize feasibility
12Related to sensitivity analysis in linear programming, when the profit increases with a unit increase in a resource, this change in profit is referred to as the:
- Aadd-in price
- Bsensitivity price
- Cshadow price
- Dadditional profit
13To specify that X1 must be at most 75% of the blend of X1, X2, and X3, we must have a constraint of the form
- AX1 >= .75(X2 + X3)
- BX1 <= .25(X1 + X2 + X3)
- CX1 <= .75(X1 + X2 + X3)
14In nonlinear models, which of the following statements are correct?
- AOnly the objective function is not a linear function of the decision variables
- BOnly the constraints are not linear functions of the decision variables
- CThe objective function and/or the constraints are not linear functions of the decision variables
- DAll of these options
15In a minimum cost network flow model, the flow balance constraint for each demand node takes the form
- AFlow in = Flow out + Net demand
- BFlow in = Flow out
- CFlow in > or =Flow out + Net demand
- DFlow out = Flow in + Net demand
16In a minimum cost network flow model, the flow balance constraint for each supply node takes the form
- AFlow in = Flow out + Net supply
- BFlow out = Flow in + Net demand
- CFlow in = Flow out
- DFlow out < or =Flow in + Net supply
17The additivity property of linear programming implies that the contribution of any decision variable to the objective is __________ of/on the levels of the other decision variables.
- Adependent
- Bindependent
- Cconditional
- Dthe sum
18The equation of the line representing the constraint 20x+10y <=1000 is:
- Ay <= -20x + 1000
- By <= -20x + 100
- C-y <= -2x + 100
- Dy <= -2x + 100
19The constraints in a blending problem can be specified in a valid way and still lead to which of the following problems?
- AUnboundedness
- BInfeasibility
- CNonlinearity
- DNone of these options
20The most important solution method for linear programming problems is known as the:
- Aspreadsheet method
- Bsolution mix method
- Ccomplex method
- Dsimplex method
21In formulating a transportation problem as linear programming model, which of the following statements are correct?
- AThere is one constraint for each supply location
- BThere is one constraint for each demand location
- CThe sum of decision variables out of a supply location is constrained by the supply at that location
- DAll of these options
22Suppose a company sells two different products, x and y, for net profits of $5 per unit and $10 per unit, respectively. The slope of the line representing the objective function is:
- A0.5
- B-0.5
- C2
- D-2
23If Xi refers to the number of hours employee i works in week j, then to indicate that the number of working hours of 4 employees in week 3 should not exceed 160 hours, we must have a constraint of the form
- AX11 + X12 + X13 + X14 <= 160
- BX13 + X23 + X33 + X43 <= 160
- CX31 + X32 + X33 + X34 <= 160
- DX43 <= 160
24Every linear programming problem involves optimizing a:
- Alinear regression model subject to several linear constraints
- Blinear function subject to several linear constraints
- Clinear function subject to several non-linear constraints
- Dnon-linear function subject to several linear constraints
25Suppose a liquor store sells beer for a net profit of $1 per unit and wine for a net profit of $2 per unit. Let x equal the amount of beer sold and y equal the amount of wine sold. An algebraic formulation of the profit function is:
- A2x + y
- Bx + 2y
- Cx + y
- D2x + 2y
26Many organizations must determine how to schedule employees to provide adequate service. If we assume that an organization faces the same situation each week, this is referred to as
- Astatic scheduling problem
- Bdynamic scheduling problem
- Ctransportation scheduling problem
- DAll of these options
27In aggregate planning models, which of the following statements are correct?
- AThe number of workers available influences the possible production levels
- BWe allow the workforce level to be modified each month through the hiring and firing of workers
- CWe eventually allow demand to be backlogged; that is, demand need not be met on time
- DAll of these options
28Suppose a firm must at least meet the minimum expected demands of 60 for product x and 80 of product y. An algebraic formulation of these constraints is
- Ax + y >= 140
- B60x + 80y >= 140
- Cx + y = 140
- Dx >= 60, y >= 80
29A common characteristic of integer programming models is that they:
- Aare easy to solve graphically
- Bproduce the same answer and standard linear programming models
- Coften produce multiple optimal solutions
- Dall of these options
30In a typical minimum cost network flow model, the nodes indicate
- Aroads
- Brail lines
- Cgeographic locations
- Drivers
31In some cases, a linear programming problem can be formulated such that the objective can become infinitely large (for a maximization problem) or infinitely small (for a minimization problem). This type of problem is said to be:
- Ainfeasible
- Binconsistent
- Cunbounded
- Dredundant
32A minimum cost network flow model (MCNFM) has the following advantage relative to the special case of a simple transportation model:
- Aa MCNFM does not require capacity restrictions on the arcs of the network
- Bthe flows in a general MCNFM don’t all necessarily have to be from supply locations to demand locations
- Ca MCNFM is generally easier to formulate and solve
- DAll of these options
33All optimization problems have:
- Aan objective function and decision variables
- Ban objective function and constraints
- Cdecision variables and constraints
- Dan objective function, decision variables and constraints
34Rounding the solution of a linear programming to the nearest integer values provides a(n)
- Ainteger solution that is optimal
- Binteger solution that may be neither feasible nor optimal
- Cfeasible solution that is not necessarily optimal
- Dinfeasible solution
35In linear programming we can use the shadow price to calculate increases or decreases in:
- Abinding constraints
- Bnonbinding constraints
- Cvalues of the decision variables
- Dthe value of the objective function
36Linear programming models have three important properties. They are:
- Aoptimality, additivity and sensitivity
- Boptimality, linearity and divisibility
- Cdivisibility, linearity and nonnegativity
- Dproportionality, additivity and divisibility
37A graphical representation of a set of rules for classifying observations into 2 or more groups is called
- Aa classification tree
- Ba binary tree
- Ca Pareto diagram
- Da branch-and-bound tree
38In discriminant analysis the averages for the independent variables for a group define the
- Acentroid
- Bmedian
- Cmode
- Dcentral tendency
39The decision rule which selects the alternative associated with the smallest maximum opportunity loss is the
- Amaximax decision rule
- Bmaximin decision rule
- Cminimax regret decision rule
- Dminimin decision rule
40The category of decision rules that contains the maximax decision rule is the
- Aoptimistic category
- Bnon-probabilistic category
- Cprobabilistic category
- Doptimality category
41Why do we create a scatter plot of the data in regression analysis?
- ATo compute the error terms
- BBecause Excel calculates the function from the scatter plot
- CTo visually check for a relationship between X and Y
- DTo estimate predicted values
42______________ is a classification technique that estimates the probability of an observation belonging to a particular group
- Alogistic regression
- Bbinary regression
- Cmultivariate analysis
- DANCOVA
43The k-nearest neighbor classification technique
- Aidentifies the k observations in the training data that are most similar to a new observation we want to classify
- Bsorts the data in an increasing order
- Csorts the data in a decreasing order
- Dworks very much like the ranking algorithm
44Affinity analysis is a data mining technique used in marketing research to determine
- Aproduct clusters
- Bthe likelihood that a product will be purchased
- Ccausality
- Dwhich products are purchased together
45Probabilistic decision rules can be used if the states of nature in a decision problem can be assigned probabilities that represent their likelihood of occurrence. Which of the following is not true regarding the probabilities employed?
- AThe probabilities are always obtained from historical data.
- BThe probabilities must always be unbiased.
- CThe probabilities can be assigned subjectively.
- DSubjective probabilities obtained can be accurate and unbiased.
46Which decision rule optimistically assumes that nature will always be "on our side" regardless of what decision we make?
- Amaximax decision rule
- Bmaximin decision rule
- Cminimax regret decision rule
- Dminimin decision rule
47If using the regression tool for two-group discriminant analysis, in the regression dialog box, the Input Y-Range entry corresponds to
- Athe group values
- Bthe independent variable values
- Cthe predictor variable values
- Dall of these are correct
48A(n) ____ is a course of action intended to solve a problem.
- Adecision
- Bcriteria
- Cstate of nature
- Dalternative
49Multiple discriminant analysis moves away from a regression approach to using a measure of distance. Which of the following characterizes the use of a distance function?
- AEach data value's distance from the origin will align with the appropriate group regression line
- BA data value will fall nearest to the centroid point of its group
- CThe distance measure accounts for the variance of the group data as well as the group centroid
- DNeither (b) nor (c) characterize the distance measure
50Regression analysis is a modeling technique
- Athat assumes all data is normally distributed
- Bfor analyzing the relationship between dependent and independent variables
- Cfor examining linear trend data only
- Dfor capturing uncertainty in predicted values of Y
51Every nonprobabilistic method has a weakness for decision making. Which of the following is incorrect regarding a method and its weakness?
- AThe maximax method ignores potentially large losses
- BThe maximin method ignores potentially large payoffs
- CThe minimax regret method can lead to inconsistent decisions
- DAll of these are correct
52Expected regret is also called
- AEMV
- BEOL
- CEPA
- DEOQ
53How are states of nature assigned probabilities?
- AUse historical data
- BUse best judgments
- CUse interview results
- DAll of these
54A payoff matrix depicts ____ versus ____ with payoffs for each intersection cell
- Adecision criteria; states of nature
- Bdecision alternatives; potential outcomes
- Cdecision alternatives; states of nature
- Ddecision criteria; potential outcomes
55Neural networks are
- Aa physical model representation of interrelationships
- Ba pattern recognition technique
- Ca non-directed graph
- Da binary network
56R2 is also referred to as
- Acoefficient of determination
- Bcorrelation coefficient
- Ctotal sum of squares
- Dregression sum of squares
57Which decision rule pessimistically assumes that nature will always be "against us" regardless of what decision we make?
- Amaximax decision rule
- Bmaximin decision rule.
- Cminimax regret decision rule.
- Dminimin decision rule
58The regression function indicates the
- Aaverage value the dependent variable assumes for a given value of the independent variable
- Bactual value the independent variable assumes for a given value of the dependent variable
- Caverage value the dependent variable assumes for a given value of the dependent variable
- Dactual value the dependent variable assumes for a given value of the independent variable
59The ____ in a decision problem represent factors that are important to the decision maker.
- Apayoffs
- Bstates of nature
- Ccriteria
- Dalternatives
60The goal of discriminant analysis is
- Ato develop a model to predict new dependent values
- Bthe develop a rule for predicting to what group a new observation is most likely to belong
- Cto develop a rule for predicting how independent variable values predict dependent values
- Dnone of these
61Leaves of a decision tree are also called ____ nodes.
- Aend
- Bterminal
- Cdecision
- Dpayoff
62The standard prediction error is
- Aalways smaller than the standard error
- Bused to construct confidence intervals for predicted values
- Cmeasures the variability in the predicted values
- Dall of these
63Residuals are assumed to be
- Adependent, uniformly distributed random variables
- Bindependent, uniformly distributed random variables
- Cdependent, normally distributed random variables
- Dindependent, normally distributed random variables
64The decision rule which determines the maximum payoff for each alternative and then selects the alternative associated with the largest payoff is the
- Amaximax decision rule
- Bmaximin decision rule
- Cminimax regret decision rule
- Dminimin decision rule
65A "risk averse" decision maker assigns the ____ relative utility to any payoff but has a(n) ____ marginal utility for increased payoffs.
- Alargest; increasing
- Blargest; diminishing
- Csmallest; diminishing
- Dsmallest; increasing
66Discriminant analysis (DA) differs from most other predictive statistical methods because the dependent variable is
- Acontinuous
- Brandom
- Cstochastic
- Ddiscrete
Información
- Descripción
- Test sobre BUAL, creado por Anthony T el 12/03/2020.
- Autor
- Anthony T
- Idioma
- English
- Visitas
- 0
- Valoración
- Aún sin valoraciones Valora este test