Optimisation

There are 11 NRICH Mathematical resources connected to Optimisation
Fence it
problem

Fence it

Age
11 to 14
Challenge level
filled star empty star empty star
If you have only 40 metres of fencing available, what is the maximum area of land you can fence off?
The Fastest Cyclist
problem

The Fastest Cyclist

Age
14 to 16
Challenge level
filled star filled star empty star
Andy is desperate to reach John o'Groats first. Can you devise a winning race plan?
Cuboid challenge
problem

Cuboid challenge

Age
11 to 16
Challenge level
filled star filled star empty star
What's the largest volume of box you can make from a square of paper?
crossing the bridge
problem

crossing the bridge

Age
11 to 18
Challenge level
filled star filled star empty star
Four friends must cross a bridge. How can they all cross it in just 17 minutes?
Gutter
problem

Gutter

Age
14 to 16
Challenge level
filled star filled star empty star
Manufacturers need to minimise the amount of material used to make their product. What is the best cross-section for a gutter?
Sending a Parcel
problem

Sending a Parcel

Age
11 to 14
Challenge level
filled star filled star empty star
What is the greatest volume you can get for a rectangular (cuboid) parcel if the maximum combined length and girth are 2 metres?
Classic cube
problem

Classic cube

Age
16 to 18
Challenge level
filled star empty star empty star
The net of a cube is to be cut from a sheet of card 100 cm square. What is the maximum volume cube that can be made from a single piece of card?
Bend
problem

Bend

Age
16 to 18
Challenge level
filled star empty star empty star
What is the longest stick that can be carried horizontally along a narrow corridor and around a right-angled bend?
Maximum Flow
problem

Maximum Flow

Age
16 to 18
Challenge level
filled star empty star empty star
Given the graph of a supply network and the maximum capacity for flow in each section find the maximum flow across the network.
Cube Net
problem

Cube Net

Age
16 to 18
Challenge level
filled star filled star empty star
How many tours visit each vertex of a cube once and only once? How many return to the starting point?