Danulearn Open Danulearn
Unit 4

Introduction to Linear Programming

📗Introduction
  • Businesses and people often want the best result — the largest profit, the smallest cost — while working within limits of money, time, space or materials.
  • Linear programming describes such problems with a linear objective function and linear inequalities, and solves them graphically.
  • In this unit you revise linear inequalities and their graphs, solve systems of linear inequalities, use the corner point method, and model real problems.
  • Every solution names the rule first and works one short step at a time, with the feasible region drawn and a table of the objective function at each corner point.
🎯 Learning Outcomes
  • Solve linear inequalities and show the solutions on number lines.
  • Graph linear inequalities and systems of linear inequalities in two variables.
  • Construct linear programming problems from real situations.
  • Solve linear programming problems by the corner point method.
  • Use a spreadsheet solver for linear programming problems.
4.1  Graphical Solutions of System of Linear Inequalities
4.1.1 Inequalities
  • A statement with one of the signs < (less than), > (greater than), ≤ (less than or equal to) or ≥ (greater than or equal to) is an inequality.
  • A linear inequality in one variable is solved like an equation, with one extra rule: when both sides are multiplied or divided by a negative number, the inequality sign is reversed.
  • The solution set is shown on a number line: an open circle for < or >, a closed circle for ≤ or ≥.
  • The one extra rule comes from the number line: multiplying by a negative number reflects every number about zero, so their order is reversed.
  • For example, from −2x < 6, dividing by −2 gives x > −3, not x < −3.

On a number line an open circle shows that the end number is not included (< or >) and a filled circle shows that it is included (≤ or ≥).

🔒
The rest of Unit 4 is in the Danulearn app

Read the full notes for all 3 sections, worked examples and figures, plus 14 exercises with step-by-step solutions, the Short Note and the unit review.

📑 Contents

  1. 4.1Graphical Solutions of System of Linear InequalitiesPreview
  2. 4.2Linear Programming Problems🔒
  3. 4.3Real Life Linear Programming Problems🔒

✍️ Practice questions

5 questions from the Unit 4 quiz. Choose an answer, then check it.

  1. 1

    A system of linear inequalities in two variables, when graphed, defines a region on the coordinate plane known as the:

    • AConstraint line
    • BFeasible region
    • CObjective function
    • DTangent region
    Show answer

    B Feasible region

  2. 2

    The feasible region of a linear programming problem represents:

    • AThe set of all points that satisfy every constraint simultaneously
    • BA single point only
    • COnly the points that violate the constraints
    • DThe objective function itself
    Show answer

    A The set of all points that satisfy every constraint simultaneously

  3. 3

    In linear programming, the function to be maximized or minimized (e.g., Z = x + y) is called the:

    • AConstraint
    • BCorner point
    • CObjective function
    • DFeasible region
    Show answer

    C Objective function

  4. 4

    The Corner Point Method for solving linear programming problems is based on the principle that the optimal solution occurs at:

    • AA point outside the feasible region
    • BAny random point within the region
    • CThe center of the feasible region
    • DOne of the vertices (corner points) of the feasible region
    Show answer

    D One of the vertices (corner points) of the feasible region

  5. 5

    To graph the linear inequality y ≤ 2x, one would shade the region:

    • AOnly along the line itself
    • BAbove the line y = 2x
    • CTo the left of the y-axis only
    • DBelow (or on) the line y = 2x
    Show answer

    D Below (or on) the line y = 2x