COMPLETE 21/08/2010

SUBJECT NAME : OPERATIONS RESEARCH (7ME3)

Question 10
In the scientific method, model parameters are:
a. always changing
b. constant during the process of solving a specific problem
c. defined as decision variables
d. found in the model solution process
ans: b
Question 2
The components of break-even analysis are:
a. volume, cost and profit
b. fixed cost, variable cost and equipment structure
c. percentage of total revenue, percentage of total cost
d. total sales, total variable revenue
answer: b
Question 4
Management science is also referred to as:
a. management
b. quantitative analysis
c. qualitative analysis
d. computer science
answer: b
Question 5
Linear programming models exhibit certain common characteristics except:
a. decision variables for measuring the level of activity
b. linearity among some constraint relationships
c. an objective function to be maximized or minimized
d. a set of constraints
answer: c
Question 6
For most graphs, the constraint equations which intersect to form a solution point must
be solved simultaneously:

a. because the solution coordinates from the graph cannot be visually read with high
precision
b. in order to confirm the mathematically determined coordinates
c. in order to determine all of the optimal point solution
d. because the slope b and the y-intercept a are not always integers
answer: d
Question 7
The maximum number of constraints that could define the feasible solution space is:
a. 2
b. 3
c. 4
d. unlimited
answer: d
Question 8
Which of the list of items below is not a component of a linear programming problem?
a. constraints
b. objective function
c. decision variables
d. a nonlinear residual
answer: d
Question 9
The change in the value of the objective function per unit increase in the value of the
right hand side is referred to as:
a. shadow price
b. quantity values
c. feasible range
d. optimal range
answer: b
Question 10
In order to transform a ">=" constraint into an equality ("=") in a linear programming
model,
a. add a slack variable
b. add a surplus variable
c. subtract a surplus variable
d. subtract a surplus variable and add a slack variable

answer: c
Question 11
A decrease in fixed costs with everything else remaining constant
a. decreases the break-even point
b. increases the break-even point
c. keeps the break-even point same
d. increases the variable costs
answer: d

Question 12
The term ____________ refers to testing how a problem solution reacts to changes in
one or more of the model parameters.
a. priority recognition
b. decision analysis
c. analysis of variance
d. sensitivity analysis
answer: d

Question 13
Which of the following could not be a linear programming problem constraint?
a. 1A + 2B
b. 1A + 2B = 3
c. 1A + 2B > 3
d. 1A + 2B < 3
answer: a

Question 14
Non-negativity constraints restrict the decision variable to
a. 0
b. positive values
c. negative values
d. both a and b

answer: d

Question 15
A graphical solution is generally limited to linear programming problems with
a. 1 decision variable
b. 2 decision variables
c. 3 decision variables
d. 4 decision variables
answer: c

Question 16
The region which satisfies all of the constraints in a graphical linear programming
problem is called the
a. region of optimality
b. feasible solution space
c. region of non-negativity
d. optimal solution space
answer: c
Question 17
The optimal solution is the ___________ feasible solution.
a. best
b. only
c. worst
d. none of the above
answer: d

Question 18
Multiple optimum solutions can occur when the objective function is _______ a
constraint line.
a. unequal to
b. equal to

c. linear to
d. parallel to
answer: b

Question 19
The optimal solution of a minimization problem is at the extreme point _________ the
origin.
a. farthest from
b. closest to
c. exactly at
d. none of the above
answer: d

Question 20
If the original amount of a resource is 25, and the range of feasibility for it can
increase by 5, then the amount of the resource can increase to
a. 25
b. 30
c. 20
d. 125
answer: d