KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesSystems of Inequalities and Linear ProgrammingEngineering · Engineering MathematicsLesson 7/8← PrevNext →
GuidePublished 14 Aug 20265 min readBy Kevin Joginsystems of inequalities and linear programmingmathematicssystems and matricesalgebra and trigonometry
On this page

Ask about this page

KEVOS AISystems of Inequalities and Linear Programming

KEVOS knowledge first · trusted web sources when needed

Engineering / Mathematics · Source section 8.7

Systems of Inequalities and Linear Programming

Systems and matrices organise multiple constraints at once. The key skill is to preserve equivalence while reducing a model to a form from which consistency, uniqueness and solutions can be read clearly.

Handbook guideLearning path: Systems and MatricesSource pages: 762-773Read time: 7 min

What this article covers

The supplied source develops Systems of Inequalities and Linear Programming as part of a wider algebra and trigonometry sequence. This handbook article consolidates the section into definitions, rules, formulae, decision methods and verification practices. It deliberately replaces named source examples with neutral technical examples while preserving the mathematical content.

The emphasis is on knowing why a method applies, not just carrying out a sequence of keystrokes. When a numerical result is produced, the final step is interpretation: what does the sign, interval, magnitude, unit, graph feature or domain restriction mean?

Learning outcomes

  • Linear inequality graph: A boundary line divides the plane; test a point to identify the satisfying half-plane.
  • Feasible region: The intersection of all constraint half-planes is the feasible set.
  • Boundary inclusion: Use a solid boundary for ≤ or ≥ and a dashed boundary for < or >.
  • Objective function: Linear programming optimises a linear quantity subject to linear constraints.

Core handbook notes

Linear inequality graph

A boundary line divides the plane; test a point to identify the satisfying half-plane.

Feasible region

The intersection of all constraint half-planes is the feasible set.

Boundary inclusion

Use a solid boundary for ≤ or ≥ and a dashed boundary for < or >.

Objective function

Linear programming optimises a linear quantity subject to linear constraints.

Corner-point principle

When an optimum exists for a bounded polygonal feasible region, it occurs at a vertex.

Model discipline

Decision variables, nonnegativity conditions, units and constraint direction must be explicitly defined.

Formula and notation panel

Use these relationships only when their domains and stated conditions are satisfied. Mathematical formulae are general principles; any values used in the worked example are illustrative.

objective Z=ax+by subject to linear constraints

Method: a reliable solving workflow

  1. 1

    Identify whether linear inequality graph is the controlling idea in the problem and list the known values, unknowns, units and domain restrictions.

  2. 2

    Translate the information into the notation used for feasible region; keep symbolic structure intact before substituting numbers.

  3. 3

    Apply the relevant rule or formula, showing intermediate algebra so sign changes, excluded values and transformations remain auditable.

  4. 4

    Use objective function to interpret the result graphically or structurally, not merely as an isolated number.

  5. 5

    Verify the result using corner-point principle, substitution, an independent calculation, graph behaviour or a dimensional check as appropriate.

Worked example

Illustrative worked example

Problem. Maximise Z=3x+2y over vertices (0,0),(4,0),(2,3).

Method and result. Evaluate Z: 0,12,12. Both (4,0) and (2,3) are optimal among these vertices.

The numbers are illustrative for learning. They are not engineering acceptance criteria, tolerances or standards.

Verification rule. Re-enter the result into the original relationship or independently reproduce the key quantity. A simplified expression, transformed graph or numerical approximation is not fully verified until it is checked against the original problem statement and domain.

Engineering and technical applications

The source is a general mathematics text. The applications below are neutral engineering-oriented extensions of the same mathematical principles rather than source requirements or standards.

#Application areaHow to use the mathematics safely
1balancing simultaneous constraintsUse the mathematics as a model, retain units, state assumptions and verify the result independently where practical.
2multi-variable process calculationsUse the mathematics as a model, retain units, state assumptions and verify the result independently where practical.
3linear transformationsUse the mathematics as a model, retain units, state assumptions and verify the result independently where practical.
4resource-allocation optimisationUse the mathematics as a model, retain units, state assumptions and verify the result independently where practical.

Decision guide

Linear inequality graphA boundary line divides the plane; test a point to identify the satisfying half-plane.
Feasible regionThe intersection of all constraint half-planes is the feasible set.
Boundary inclusionUse a solid boundary for ≤ or ≥ and a dashed boundary for < or >.

When several techniques appear possible, prefer the method that exposes structure and preserves exactness. For example, factor before expanding if factorisation reveals zeros; use an exact special-angle value before a decimal approximation; simplify symbolically before substituting repeated numerical values; and state excluded values before cancelling rational factors.

Technology is best used as a verification and exploration tool. A graph can reveal missed roots or unreasonable behaviour, and a calculator can evaluate difficult arithmetic, but neither replaces a clear statement of the model, domain, units and algebraic logic.

Common mistakes and failure modes

  • Applying a familiar rule before identifying whether the problem is actually a systems of inequalities and linear programming problem.
  • Dropping parentheses or a sign during substitution, expansion, factorisation or rearrangement.
  • Ignoring domain restrictions, undefined values, endpoint inclusion or principal-value conventions.
  • Rounding too early and then treating a rounded intermediate result as exact.
  • Accepting a calculator output without checking algebraic structure, units or plausibility.

A strong technical calculation is auditable. Someone else should be able to follow the variable definitions, reproduce the algebra, identify any approximation and understand why the final answer is admissible.

Verification checklist

✓State the domain, constraints and units before manipulating the equation or model.
✓Use a formula only after confirming that its assumptions and variable meanings match the problem.
✓Keep enough intermediate precision to avoid avoidable rounding drift.
✓Check signs, quadrant, interval or excluded values whenever the topic involves them.
✓Verify with substitution, an inverse operation, a graph, a second method or a dimensional check.
✓Separate illustrative learning values from any real engineering requirement or acceptance criterion.

Practice prompts

Concept check

Explain the difference between the mathematical object being studied in this article and the nearest related concept from the same learning path. State at least one condition that determines which method is valid.

Symbolic check

Choose one formula from the panel, rearrange it for a different variable where meaningful, and identify every value that would make the rearranged expression undefined or outside the real-number domain.

Graph or structure check

Predict the qualitative behaviour before calculating: signs, intercepts, symmetry, end behaviour, monotonicity, periodicity or feasible region as appropriate to the topic. Then compare with a calculated or plotted result.

Applied check

Create a small engineering example using consistent SI units. Solve it, report the result with sensible precision, and state which assumptions would need confirmation before the calculation could support a real design decision.

Related KEVOS mathematics pages

  • Determinants and Cramer’s Rule
  • Partial Fractions
  • Systems of Equations in Two Variables
Source basis. Uploaded algebra and trigonometry textbook PDF, section 8.7, source pages 762-773. The source includes exercises, diagrams and worked examples; this article paraphrases the instructional mathematics and replaces named entities with neutral examples. No external standard, tolerance or regulatory requirement is asserted.

Continue learning

Determinants and Cramer’s RuleGuide · Engineering MathematicsNEXT LESSON →Partial FractionsGuide · Engineering MathematicsInverses of MatricesGuide · Engineering MathematicsMatrix OperationsGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®