BSIE Operations Research & Linear Programming 3

Question 1

Which heuristic is commonly used to solve the Traveling Salesman Problem (TSP)?

Accepted Answer

Nearest neighbor heuristic

Answer

Simplex algorithm

Answer

Dijkstra's algorithm

Answer

Bellman-Ford algorithm

Question 2

What is the reorder point in inventory management?

Accepted Answer

The inventory level at which a new order should be placed

Answer

The order quantity that minimizes total cost

Answer

The maximum stock level

Answer

The safety stock quantity

Question 3

In simulation, what does Monte Carlo simulation primarily rely on?

Accepted Answer

Random number generation to model probabilistic systems

Answer

Differential equations

Answer

Linear programming formulations

Answer

Markov chain steady-state analysis

Question 4

What does 'slack' mean for a non-critical activity in a project network?

Accepted Answer

The amount of time an activity can be delayed without delaying the project

Answer

The amount of extra resources available

Answer

The difference between PERT and CPM estimates

Answer

The buffer added to pessimistic time estimates

Question 5

Which of the following best describes integer programming?

Accepted Answer

Optimization where some or all decision variables must take integer values

Answer

LP with only integer coefficients in constraints

Answer

Programming where the objective is an integer

Answer

LP solved using only whole numbers for the RHS

Question 6

In queuing theory, what is the traffic intensity (ρ) and what happens when ρ ≥ 1?

Accepted Answer

ρ = arrival rate / service rate; queue grows indefinitely when ρ ≥ 1

Answer

ρ = service rate / arrival rate; stable queue

Answer

ρ = queue length / service rate; system is efficient

Answer

ρ = idle time / busy time; system is overloaded when ρ < 1