Please enable JavaScript.

Coggle requires JavaScript to display documents.

SYSTEMS - Coggle Diagram

- - - - Linear combination
        
        The linear combination method works by solving and ending up with a single equation in one variable, which can easily be solved. Once the equation is solved, a value found is substituted into one of the original equations.
        
        Example: {y=2x+6 {2y=x+3 y=2x+6 -2y=x+3. -y=x+3 {y=0 {x=-3
      - Substitution
        
        The substitution method works by solving one of the equations (you choose which one) for one of the variables (you choose which one), and then plugging this back into the other equation, "substituting" for the chosen variable and solving for the other.
        
        Example: {y=2x {x=3y-5 x=3(2x)-5 x=6x-5 -5x=-5 x=1 y=2(1) y=2 {x=1 {y=2
      - Matrix form
      - Linear programming
- - - - The boundary is the actual line that divides the half-plane
    - - The feasible area has the same function of the interception, except in this case it represents an entire shaded are that is covered by the inequality juncture.
    - - An inequality has two half-planes, represented by the two parts divided by the boundary