BSIE Operations Research & Linear Programming

Question 1

In linear programming, what is the region that satisfies all constraints called?

Accepted Answer

Feasible region

Answer

Objective region

Answer

Optimal region

Answer

Constraint region

Question 2

Which method is most commonly used to solve large-scale linear programming problems?

Accepted Answer

Simplex method

Answer

Graphical method

Answer

Branch-and-bound

Answer

Hungarian algorithm

Question 3

In the transportation problem, what condition must be met for a balanced problem?

Accepted Answer

Total supply equals total demand

Answer

Number of sources equals number of destinations

Answer

All costs are equal

Answer

All routes are used

Question 4

What does the dual price (shadow price) represent in linear programming?

Accepted Answer

The rate of change of the objective function per unit increase in a constraint's RHS

Answer

The cost of adding a new variable

Answer

The penalty for infeasibility

Answer

The reduced cost of a basic variable

Question 5

In queuing theory, what does the notation M/M/1 represent?

Accepted Answer

Markovian arrivals, Markovian service, 1 server

Answer

Multiple arrivals, multiple servers, 1 queue

Answer

Mixed arrivals, mixed service, 1 priority

Answer

Manual arrivals, manual service, 1 stage

Question 6

Which of the following is NOT an assumption of linear programming?

Accepted Answer

Non-linear objective

Answer

Linearity

Answer

Divisibility

Answer

Certainty