โ† All BSIE Flashcard Decks

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
  1. What is the assignment problem in operations research primarily used for?

    Answer: Optimally matching n workers to n jobs

    The assignment problem seeks to optimally assign n agents to n tasks to minimize total cost or maximize total profit.

  2. In the critical path method (CPM), the critical path is defined as:

    Answer: The longest path through the project network determining project duration

    The critical path is the longest sequence of dependent activities and determines the minimum project completion time.

  3. Which inventory model assumes constant demand and instantaneous replenishment?

    Answer: Economic Order Quantity (EOQ) model

    The classic EOQ model assumes deterministic constant demand and instantaneous lead time to derive the optimal order quantity.

  4. In PERT, what probability distribution is used to model activity durations?

    Answer: Beta distribution

    PERT uses the beta distribution to model uncertain activity durations based on optimistic, most likely, and pessimistic time estimates.

  5. What is the purpose of sensitivity analysis in linear programming?

    Answer: To determine how optimal solution changes with parameter variations

    Sensitivity analysis examines the range over which objective coefficients or right-hand-side values can change without altering the optimal basis.

  6. In a network flow problem, what does the max-flow min-cut theorem state?

    Answer: Maximum flow equals the capacity of the minimum cut

    The max-flow min-cut theorem states that the maximum flow through a network equals the capacity of its minimum cut separating source from sink.