Modelling a linear programme

Going from a word problem to a linear programme: decision variables, objective function, constraints, sign conditions, feasible solution, and what makes a relation linear or not. Three typical problems: production, blending, transport.

  • 27 cards
  • 3 topics
  • Free

The outline, topic by topic

Each topic is weighted the way the exam weighs it.

  1. Concepts
  2. Questions
  3. Sort and link

A few cards from the deck

  • Linear programme: what is it?

    Show the answer

    A problem that maximises or minimises an expression of degree 1 in unknowns subject to equalities or inequalities of degree 1.

    Everything is of degree 1: no product of two unknowns, no square, no inverse. That regularity is what lets us solve it with certainty.

  • A table earns €30 and a chair €20. With x tables and y chairs, which objective function is to be maximised?

    • 30x + 20y
    • 20x + 30y
    • 30x × 20y
    • 50(x + y)
    Show the answer

    30x + 20y

    Each product contributes its unit profit times its quantity, and we add. Swapping the coefficients or multiplying them no longer describes the workshop's profit.

  • To build a model, first set the …, then the …, then the ….

    Show the answer

    To build a model, first set the decision variables, then the objective function, then the constraints.

    This order avoids mixing roles: neither the objective nor a constraint can be written before we know what x and y stand for.

  • Decision variable: what is it?

    Show the answer

    An unknown of the model whose value stands for a choice the decision maker controls, for example a quantity to make.

    They come first, with their unit: “x = number of tables”. A figure given in the statement, such as a price or a capacity, is not a decision variable.

  • A table takes 2 h of carpentry and a chair 1 h; the workshop has 100 h. Which constraint expresses this limit?

    • x + 2y ≤ 100
    • 2x + y ≤ 100
    • 2x + y ≥ 100
    • 2x + y ≤ 3
    Show the answer

    2x + y ≤ 100

    Hours used are 2 per table plus 1 per chair, and they must not exceed the stock: hence ≤ 100. x + 2y swaps the coefficients; 3 is the time to make one of each, not the stock of hours.