Linear Equation

It is an algebraic equation in which each term is either a constant or the product of a

constant and a single variables

System of Linear Equation

It is the common point (ordered pair) of any two given linear equation.

Inconsistent

a solution of empty set and the graph consist of two parallel lines

Dependent

a solution that contain an infinite number of solution and the graphs are two coincident
lines

Consistent

it contains only one solution and the graph are lines with intersect at one point

Swiss Mathematician Gabriel Cramer

created Cramer's Rule

Equality

a statement that one quantity or expression is greater than or less than to another quantity
or expression

Absolute Inequality

it is a condition where the inequality is true for all the values of the unknown involve.

Conditional inequalities

it is a condition where the inequality is true for certain values of the unknown involved.

Linear Programming

- method of dealing with decision problems that can be expressed as constrained linear
models

- a mathematical technique for finding the best uses of an organization's resources

George Dantzig

discovered linear programming

Graphical solution Method

a two - dimensional geometric analysis of Linear Programming with two decision variables

theory of Linear Programming

states that the optimal solution will lie at the corner point of the feasible region

Objective Function

Is an expression, which shows the relationship between the variable in the problem and the
firm's goal

Structural Constraint

it is a limit on the availability of resources.

Non - Negativity constraint

it is the constraint that restricts all the variable to zero and positive solution

optimal Value

highest ( Maximization Problem) or Lowest value ( For minimization problem) of the

objective function

Optimal Solution

Is the combination of decision variable amount that yields the best possible value of the
objective function and satisfy all constraints

Feasible Region

set of combination of values for the decision variables that satisfy the non - negativity
condition and all shall the constraints simultaneously that is allowable decision

Extreme point Theorem

linear objective function will have optimal solution at the extreme points(corner points) of
the feasible region whenever there the feasible is bounded

Simplex Method

iterative technique that begin with a feasible solution that is not optimal, but serve as
starting point

General Linear Programming Model

A linear programming in (n) means unknowns such as X, X, X, ....X is one we are to

determine the maximum or the minimum value of the objective function

Standard Linear Programming Maximization Model

are required to maximize an object function of the form

Standard Linear Programming Minimization Model

are required to minimize an objective function of the form

Maximality test

it will note an optimal solution if and only the last row of a simplex tableau corresponding
to the objective function, contains no negative entries

Basic Variable

- are the variables included in in a basic solution.

Simplex Tableau

- it is a table use to keep track of the calculation made when simplex method is employed.

Right Hand Side

it is the column in a simplex tableau indicating the quantities of the variables is in a

solution.

Pivot Column

- It is the column in any solution to a maximization problem which has the lowest negative
value in the last row.

Pivot Row

- it is the row in the simplex tableau corresponding to the basic variable that will leave the
solution. It is determine by the test ratio.

Test Ratio

- It is being computed by dividing the RHS by the Intersectional Elements.

Intersectional Elements

- are elements common both to pivot row and column.

Primal Problem

- it is the original formulation of linear programming problem.

Dual Problem

- it is a counterpart linear programming associated with the primal solution.

Transportation model
special procedure of linear programming for finding the minimum cost for distributing
homogenous units of a product from several points of supply(origin) to a number of points
of demand(destination)

Destination

It is a point of demand in a transportation

Origin

It is a point or sources of supply location in a transportation problem.

Unused Squares

Are square which represents routes where no quantity is shipped between a source and a
destination

Stone Square

Used squares in the transportation problem.

Northwest Corner Rule

- a procedure for obtaining an initial feasible solution to a transportation problem that

starts with allocating units to the upper left - hand corner and ends in the lower right
corner of any transportation problem.

Minimum Cost Method (MCM)

- A systematized procedure used to find an initial feasible solution to a transportation

problem.

- This methods allocates as much as possible to the least cost / highest profit cell.

Vogel's Approximation Method

- algorithm that finds an initial feasible solution to a transportation problem by considering

the "penalty cost" of not using the cheapest available route

-usually produces an optimal solution or near optimal starting solution