MGT REVIEWER FOR PRELIMS play an important role in such sciences as

engineering, physics, economics, chemistry

Systems of linear equations (or linear and computer science, as well as modeling
systems as they are called sometimes) complex systems.
are defined as collections of linear
Linear Equations - A linear equation in one
equations that use the same set of
unknown is an equation in which the only
variables. That means that within systems
exponent on the unknown is 1. A linear
of linear equations you have two or more
equation is an equation for a straight line.
linear equations with the same variables.
The General Form of a basic linear
This is an example of such a system:
equation is: ax + by = c
3x – 5y = 16

There are three types of systems of linear

x – 3y = 8
equations in two variables, and three
This example shows a linear types of solutions.
system with two equations and two
An independent system has exactly one
variables. The number of equations in a
solution pair (x, y). The point where the two
system, as well as the number of variables,
lines intersect is the only solution.
is not limited. But the number of solutions
varies depending on the ratio of equations
An inconsistent system has no solution.
and variables in the system. If there are
Notice that the two lines are parallel and will
more variables than equations in a linear
never intersect.
system, such a system has infinitely many
solutions or sometimes unique sparse
A dependent system has infinitely many
solutions. A system like that is called an
solutions. The lines are coincident. They are
underdetermined system. If a system has the same line, so every coordinate pair on
the same number of equations and the line is a solution to both equations.
variables, it has a single unique solution.
But, if a system of linear equations has The addition method of solving systems of
more equations than unknowns, it doesn’t equations is also called the method of
have a solution. Such a system is called an elimination. This method is similar to the
overdetermined system. method you probably learned for solving
simple equations.
Systems of linear equations are an
important part of linear algebra and they
The method of solving by substitution some situation, and finding the "best" value
works by solving one of the equations (you obtainable under those conditions. A typical
choose which one) for one of the variables example would be taking the limitations of
(you choose which one), and then plugging materials and labor, and then determining
this back into the other equation, the "best" production levels for maximal
"substituting" for the chosen variable and profits under those conditions.
solving for the other. Then you back-solve
for the first variable. In "real life", linear programming is part of a
very important area of mathematics called
The idea here is to solve one of the "optimization techniques". This field of
equations for one of the variables, and plug study (or at least the applied results of it)
this into the other equation. It does not are used every day in the organization and
matter which equation or which variable you allocation of resources. These "real life"
pick. There is no right or wrong choice; the systems can have dozens or hundreds of
answer will be the same, regardless. But — variables, or more. In algebra, though, you'll
some choices may be better than others. only work with the simple (and graphable)
two-variable linear case.
The fifth method of solving system of linear
equations is by graphical. The general process for solving
linear-programming exercises is to graph
STEPS IN SOLVING SYSTEM OF LINEAR the inequalities (called the "constraints")
EQUATIONS BY GRAPHICAL METHOD to form a walled-off area on the x,y-plane
(called the "feasibility region"). Then you
● Solve the two given equations for x figure out the coordinates of the corners of
and y values. (coordinates) this feasibility region (that is, you find the
● Graph each equation on the same intersection points of the various pairs of
Cartesian Coordinate Plane. lines), and test these corner points in the
● Find the point of intersection. The formula (called the "optimization
point of intersection is the solution equation") for which you're trying to find the
set. highest or lowest value.
● Check by substituting the obtained
values of the variables in the original Linear programming is a simple technique
equations. where we depict complex relationships
through linear functions and then find the
Linear programming is the process of optimum points. The important word in the
taking various linear inequalities relating to previous sentence is depict. The real
relationships might be much more complex Constraints: The constraints are the
– but we can simplify them to linear restrictions or limitations on the decision
relationships. variables. They usually limit the value of the
decision variables. In the above example,
Applications of linear programming are the limit on the availability of resources Milk
everywhere around you. You use linear and Choco are my constraints.
programming at personal and professional
fronts. You are using linear programming Non-negativity restriction: For all linear
when you are driving from home to work programs, the decision variables should
and want to take the shortest route. Or always take non-negative values. Which
when you have a project delivery you make means the values for decision variables
strategies to make your team work should be greater than or equal to 0.
efficiently for on time delivery.
Process to formulate a Linear
Common terminologies used in Linear Programming problem:
Programming:
Let us look at the steps of defining a Linear
Let us define some terminologies used in Programming problem generically:
Linear Programming using the above
example. ● Identify the decision variables
● Write the objective function
Decision Variables: The decision variables ● Mention the constraints
are the variables which will decide my ● Explicitly state the non-negativity
output. They represent my ultimate solution. restriction
To solve any problem, we first need to
identify the decision variables. For the For a problem to be a linear programming
above example, the total number of units for problem, the decision variables, objective
A and B denoted by X & Y respectively are function and constraints all have to be linear
my decision variables. functions.

Objective Function: It is defined as the If all the three conditions are satisfied, it is
objective of making decisions. In the above called a Linear Programming Problem.
example, the company wishes to increase
the total profit represented by Z. So, profit is
my objective function.