Linear Programming and Queueing Theory Quiz

What describes the feasible region in a Linear Programming Problem (LPP)?

Which of the following is NOT considered an assumption of Linear Programming Problems (LPP)?

In a transportation problem, if the total allocation is $m+n-1$, what does this imply about the problem's condition?

Which method is primarily used to solve an Assignment problem?

In an M/M/1 queue, if the arrival rate $ abla$ is 5 customers per hour and the service rate $eta$ is 10 customers per hour, what is the utilization factor (p)?

inventory carrying costs only in activity durations.

Multiple Choice Questions (Section A)

The feasible region in a Linear Programming Problem (LPP) encompasses all points where constraints are satisfied
It's the area where the objective function achieves its maximum value
The statements, "area where all constraints are satisfied" and "area where the objective function has maximum value only," describe the feasible region.

Assumptions of Linear Programming Problems (LPP)

Linearity of relationships, additivity of constraints, and divisibility of decisions are all assumptions of LPP.
Non-negativity of constraints is also a key assumption.

Transportation Problems

A transportation problem is considered degenerate if the total allocation equals m + n - 1.
Assignment problems are solved using the Hungarian Method.

Queueing Theory (M/M/1 Queue)

Utilization factor (p) for an M/M/1 queue is calculated as: arrival rate / service rate
In an M/M/1 queue, with an arrival rate of 5 customers per hour and a service rate of 10 customers per hour, the utilization factor is 0.5.

Economic Order Quantity (EOQ)

If the order quantity is doubled in a basic EOQ model, the holding cost increases by half.

PERT (Program Evaluation and Review Technique)

Activity durations in PERT are often probabilistic.

Critical Path Method (CPM)

The critical path in a CPM network determines the minimum project duration.

Zero-Sum Two-Person Games

In zero-sum two-person games, the sum of profit and loss is always zero.

Test your understanding of Linear Programming Problems (LPP), including feasible regions and assumptions. This quiz also covers concepts related to Transportation Problems and Queueing Theory, specifically the M/M/1 queue model. Challenge yourself with questions that explore these critical operations research topics.