Scribd
Upload
7 views3 pages

OTExp 3

The document outlines an experiment focused on implementing linear programming using the graphical method, specifically for problems with two variables. It explains key concepts such as feasible solutions, basic solutions, and optimal solutions, along with the steps to graphically determine the optimal solution by identifying extreme points in the feasible region. The document also includes theorems related to linear programming that support the graphical solution approach.

Uploaded by

akaria6996
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views3 pages

OTExp 3

The document outlines an experiment focused on implementing linear programming using the graphical method, specifically for problems with two variables. It explains key concepts such as feasible solutions, basic solutions, and optimal solutions, along with the steps to graphically determine the optimal solution by identifying extreme points in the feasible region. The document also includes theorems related to linear programming that support the graphical solution approach.

Uploaded by

akaria6996
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

EXPERIMENT NO.

03

DATE OF PERFORMANCE: GRADE:

SIGNATURE OF LECTURER/
DATE OF ASSESSMENT:
TTA:

AIM: To study and implement linear programming in graphical method.

Theory:

For LP problems that have only two variables, it is possible that the entire set of
feasible solutions can be displayed graphically by plotting linear constraints on
a graph paper in order to locate the best (optimal) solution. The technique used
to identify the optimal solution is called the graphical solution method
(approach or technique) for an LP problem with two variables.

An optimal as well as a feasible solution to an LP problem is obtained by


choosing one set of values from several possible values of decision variables x1,
x2, . . ., xn, that satisfies the given constraints simultaneously and also provides
an optimal (maximum or minimum) value of the given objective function.

Solution: The set of values of decision variables xj ( j = 1, 2, . . ., n) that satisfy


the constraints of an LP problem is said to constitute the solution to that LP
problem.

Feasible solution: The set of values of decision variables xj ( j = 1, 2, . . ., n) that


satisfy all the constraints and non-negativity conditions of an LP problem
simultaneously is said to constitute the feasible solution to that LP problem.

Infeasible solution: The set of values of decision variables xj ( j = 1, 2, . . ., n)


that do not satisfy all the constraints and non-negativity conditions of an LP
problem simultaneously is said to constitute the infeasible solution to that LP
problem.

Basic solution: For a set of m simultaneous equations in n variables (n > m) in


an LP problem, a solution obtained by setting (n – m) variables equal to zero

1
and solving for remaining m equations in m variables is called a basic solution
of that LP problem. The (n – m) variables whose value did not appear in basic
solution are called non-basic variables and the remaining m variables are called
basic variables.

Basic feasible solution: A feasible solution to an LP problem which is also the


basic solution is called the basic feasible solution. That is, all basic variables
assume non-negative values. Basic feasible solution is of two types:
(a) Degenerate A basic feasible solution is called degenerate if the value
of at least one basic variable is zero.
(b) Non-degenerate A basic feasible solution is called non-degenerate if
value of all m basic variables is non-zero and positive.

Optimum basic feasible solution: A basic feasible solution that optimizes


(maximizes or minimizes) the objective function value of the given LP problem
is called an optimum basic feasible solution.

Unbounded solution: A solution that can increase or decrease infinitely the


value of the objective function of the LP problem is called an unbounded
solution.

Graphical solution methods of LP problem:


While obtaining the optimal solution to the LP problem by the graphical
method, the statement of the following theorems of linear programming is used
(i) The collection of all feasible solutions to an LP problem constitutes a
convex set whose extreme points correspond to the basic feasible
solutions.
(ii) There are a finite number of basic feasible solutions within the feasible
solution space.
(iii) If the convex set of the feasible solutions of the system of simultaneous
equations: Ax = b, x ≥ 0, is a convex polyhedron, then at least one of the
extreme points gives an optimal solution.
(iv) If the optimal solution occurs at more than one extreme point, the value
of the objective function will be the same for all convex combinations of
these extreme points.

Extreme Point Solution Method:

2
In this method, the coordinates of all corner (or extreme) points of the feasible
region (space or area) are determined and then value of the objective function at
each of these points is computed and compared. The coordinates of an extreme
point where the optimal (maximum or minimum) value of the objective function
is found represent solution of the given LP problem.
The steps of the method are as follows:
Step 1 : Develop an LP model: State the given problem in the mathematical LP
model as illustrated in the previous chapter.
Step 2 : Plot constraints on graph paper and decide the feasible region
(a) Replace the inequality sign in each constraint by an equality sign.
(b) Draw these straight lines on the graph paper and decide each time the
area of feasible solutions according to the inequality sign of the constraint.
Shade the common portion of the graph that satisfies all the constraints
simultaneously drawn so far.
(c) The final shaded area is called the feasible region (or solution space)
of the given LP problem. Any point inside this region is called feasible solution
and this provides values of x1 and x2 that satisfy all the constraints.
Step 3 : Examine extreme points of the feasible solution space to find an
optimal solution
(a) Determine the coordinates of each extreme point of the feasible
solution space.
(b) Compute and compare the value of the objective function at each
extreme point.
(c) Identify the extreme point that gives optimal (max. or min.) value of
the objective function.

You might also like