Applied maths 19.1: Network flows and shortest paths
Plan with networks: shortest routes, the critical path that sets a project's length, and the maximum flow a network can carry. A delivery firm wants the quickest route, a builder wants to knowโฆ
8 posts match
Plan with networks: shortest routes, the critical path that sets a project's length, and the maximum flow a network can carry. A delivery firm wants the quickest route, a builder wants to knowโฆ
Plan with whole numbers and yes-or-no choices: why rounding fails, knapsack problems, fixed costs and branch and bound. An airline cannot fly 2.6 planes, and a council cannot build 0.4 of a schoolโฆ
Why queues explode as a server gets busy: arrival and service rates, utilisation, the M/M/1 formulas and Little's law. A checkout that is busy 80 % of the time has short queues. Push it to 95 % andโฆ
Choose under uncertainty: expected monetary value, decision trees, the value of information, and attitudes to risk. An oil company must decide whether to drill before it knows if there is oil. Aโฆ
Decisions against other decision makers: payoff tables, dominant strategies, Nash equilibria, and mixed strategies in 2 ร 2 games. Two cafรฉs on the same street set their prices. A penalty takerโฆ
How to bid, and how to design the rules: first- and second-price auctions, truthful bidding, bid shading and expected revenue. Every time a web page loads, an auction decides which advert appearsโฆ
Fourteen questions across operations research and game theory, with new numbers on every attempt. Pass at 80 % to move on to unit 20. This is where you find out what you can do without help. Eachโฆ
The numerical methods inside circuit simulators, measurement uncertainty, and the skills of research: literature, experiments, writing and ethics. Every lab in this course was graded by a programโฆ