Operations Research & Linear Programming Flashcards
6 cards from real BSIE practice questions. Tap to flip, then mark Knew It or Still Learning — missed cards come back until you master them.
Read the first 6 Operations Research & Linear Programming flashcards as text
In linear programming, what is the region that satisfies all constraints called?
Answer: Feasible region
The feasible region is the set of all points that satisfy every constraint in a linear programming problem.
Which method is most commonly used to solve large-scale linear programming problems?
Answer: Simplex method
The simplex method iterates along the edges of the feasible polytope to find the optimal vertex efficiently for large-scale LP problems.
In the transportation problem, what condition must be met for a balanced problem?
Answer: Total supply equals total demand
A balanced transportation problem requires that the sum of all supplies equals the sum of all demands.
What does the dual price (shadow price) represent in linear programming?
Answer: The rate of change of the objective function per unit increase in a constraint's RHS
The shadow price tells the decision-maker how much the optimal objective value improves for each one-unit relaxation of a binding constraint.
In queuing theory, what does the notation M/M/1 represent?
Answer: Markovian arrivals, Markovian service, 1 server
M/M/1 denotes a queue with Poisson (Markovian) arrivals, exponential (Markovian) service times, and a single server.
Which of the following is NOT an assumption of linear programming?
Answer: Non-linear objective
LP requires a linear objective function; a non-linear objective violates the fundamental linearity assumption of the model.