Problems that seek to maximise profit or minimise cost are called:

1. A whole family of problems asks for the best value rather than any value. 2. They may seek the largest profit or the smallest cost. 3. Such problems form a general class called optimisation problems. 4. Linear programming is an important special case of them. _Source: syllabus Mathematics Part II, Ch 12 'Linear Programming'_