REVIEWER Flashcards
In a maximization problem, how is the optimal value of the objective function determined from the final simplex tableau?
It is the largest value in the last row
It is the smallest value in the solution column
It is the value in the bottom-right corner of the tableau
It is the sum of all coefficients in the last row
It is the value in the bottom-right corner of the tableau
In the initial Simplex tableau, which column is selected as the pivot column?
The column with the largest positive coefficient in the constraints
The column corresponding to the variable with the most negative coefficient in the objective function row
The column with the smallest coefficient in the right-hand side column
The column with the highest slack variable coefficient
The column corresponding to the variable with the most negative coefficient in the objective function row
Which of the following points is a solution to the inequality y>3x-5?
(0, -8)
(2, -6)
(5, -1)
(-1, 1)
(-1, 1)
Which of the following conditions must be satisfied for an optimal solution to exist in a linear programming problem?
The feasible region must be empty
The feasible region must be bounded
The objective function must be quadratic
The constraints must be nonlinear
The feasible region must be bounded
Which of the following properties of linear programming states that any increase or decrease in the value of a decision variable will result in a corresponding proportional increase or decrease in the objective function and constraints?
Divisibility
Additive
Multiplicative
Proportionality
Proportionality
In a minimization problem, when does the Simplex Method stop?
When the RHS values are zero
When all entries in the last row are positive or zero
When a basic variable becomes negative
When all entries in the last row are negative
When all entries in the last row are positive or zero
What is the first step after selecting the pivot element in the Simplex Method?
Divide the pivot row by the pivot element to make the pivot equal to 1
Ignore the pivot element and move to the next iteration
Multiply the entire tableau by the pivot element
Replace the pivot column with zeros
Divide the pivot row by the pivot element to make the pivot equal to 1
What does an unbounded solution mean in the Simplex Method?
The objective function value can increase indefinitely
The problem has no feasible region
The problem has multiple optimal solutions
The problem has no solution
The objective function value can increase indefinitely
If an LPP has more constraints than decision variables, what does it imply?
The problem is always infeasible
The problem must be solved using the graphical method
The problem has multiple solutions
The problem may have redundant constraints
The problem may have redundant constraints
Which of the following will reduce the average waiting time in a queuing system?
Increasing the arrival rate (λ)
Increasing customer balking
Reducing the service rate (μ)
Adding more servers
Adding more servers
The objective function of an LP transportation problem of shipping goods from a plant to a warehouse is:
min C = 7y11 + 7y12 + 14y13 + 8y21 + 4y22 + 9y23
14 units are needed to transport goods from P1 to W3.
It costs PHP 14.00 to transport goods from P1 to W3.
It costs PHP 14.00 to transport goods from P3 to W1.
14 units are needed to transport goods from P3 to W1.
It costs PHP 14.00 to transport goods from P1 to W3.
Which of the following best describes the Vogel’s Approximation Method (VAM)?
A method that minimizes the total number of allocations
A heuristic method that gives a good initial feasible solution
A method that guarantees the optimal solution
A method that only works for balanced problems
A heuristic method that gives a good initial feasible solution
The following assumptions are considered in the process of computing break-even analysis, except ______
Throughout the output level, sales price per unit is constant.
All the costs can be considered as variable costs.
Straight-line cost and revenue behavior.
Total fixed costs remain constant at all the output levels.
All the costs can be considered as variable costs.
The MODI Method is best suited for ______
Assignment problems
Checking and improving an existing solution
Maximization problems
Finding the initial solution
Checking and improving an existing solution
A queuing system where customers are served in the order they arrive is called _____.
First-In-First-Out (FIFO)
Random selection
Priority scheduling
Last-In-First-Out (LIFO)
First-In-First-Out (FIFO)
The actual sales made over the break-even point, which generates profit is considered as the margin of safety.
Margin of Safety
Contribution Margin Per unit
Contribution Margin Ratio
Margin of Safety Ratio
Margin of Safety
If a system has an infinite queue length, it means ______.
There is a limited number of customers
No service is provided
Customers may have to wait indefinitely
The queue is always empty
Customers may have to wait indefinitely
If the arrival rate (λ) is greater than the service rate (μ), the system will_____.
Reach an optimal level
Become overloaded and never empty
Always remain empty
Remain stable
Become overloaded and never empty
Which of the following methods is used for project scheduling?
CPM (Critical Path Method)
PERT (Program Evaluation and Review Technique)
All of these
Gantt Charts
All of these
Which of the following statements is FALSE about the Least Cost Method?
It guarantees an optimal solution
It is more cost-effective than the Northwest Corner Rule
It considers the lowest transportation cost for allocation
It provides an initial feasible solution
It guarantees an optimal solution
Which of the following is NOT a component of a queuing system?
Queue discipline
Service mechanism
Fixed cost structure
Arrival process
Fixed cost structure
Contribution refers to the amount of sales revenue which is available to pay off the fixed cost of the project after meeting the variable cost.
True
False
True
Markov Analysis is a method of analyzing the current behavior of some variable
to predict the future behavior of that same variable.
True
False
True
In a queuing system, the term “queue discipline” refers to ____.
The total number of servers
The way customers arrive at the system
The speed of service
The order in which customers are served
The order in which customers are served