Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
410 views

Special Cases Linear Programming

This document discusses different types of solutions that can arise when solving linear programming problems using the simplex method. It describes degenerate solutions that occur when basic variables are tied, leading to non-unique solutions or zero-valued basic variables. It also discusses alternate optimal solutions that yield the same objective value and unbounded solutions where decision variables can increase without limit. The document provides an example of an infeasible problem with inconsistent constraints that have no feasible solution.

Uploaded by

Archana Karuni
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
410 views

Special Cases Linear Programming

This document discusses different types of solutions that can arise when solving linear programming problems using the simplex method. It describes degenerate solutions that occur when basic variables are tied, leading to non-unique solutions or zero-valued basic variables. It also discusses alternate optimal solutions that yield the same objective value and unbounded solutions where decision variables can increase without limit. The document provides an example of an infeasible problem with inconsistent constraints that have no feasible solution.

Uploaded by

Archana Karuni
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 14

Submitted to: Dr.Subba Rao Professor Dept.of Agril.

Economics ANGRAU

Degenerate solution
Alternate optimum solution Unbounded solution Unbounded solution space with finite solution Infeasible solution

Degenerate Solution
While solving a linear programming problem the

situation may arise in which there is a tie between two or more basic variables, to leave basis is not unique or value of one or more basic variable in the solution values column becomes equal to zero.
This causes the problem of Degeneracy

contd..
However if minimum ratio is zero then complex

interactions cycle repeat indefinitely without arriving at optimal solution. It is rare in practical problems.
Degeneracy may occur at any iteration of simplex

method .
In most of the cases when there is a tie in minimum

ratios, the selection is made arbitrary.

contd..
However the no. of iterations required to arrive at

optimal solution can be minimized by adopting following rules:


Divide coefficients of slack variable in simplex table,

where there the degeneracy is detected by corresponding positive numbers of key column row, starting from left to right . The row which contains smallest ratio comparing from left to right column becomes key row.

Alternative Optimal solution


Optimum solution of any linear programming problem

occurs at extreme point of feasible region and solution is not unique. Or No other solution yields same value of objective function.
However in certain cases a given linear programming

problem may have more than one optimal solution yielding the same objective function value

contd..
There are two conditions that should be satisfied in order

that an alternative optimal solution exists.


The given pbjective function is parallel to a constraint that

forms the boundary of feasible solution region.


The constraint should form a boundary on the feasible

region in direction of optimal movement of objective function.

contd..
The existence of alternative method optimal solution has

opportunity cost, dij for the unoccupied cells.


If an unoccupied cell in an optimal solution has opportunity

solution has opportunity cost zero, then an alternative optimal solution can be formed with another set of allocation without increasing total operation cost.

When the value of the decision variable in linear

programming is permitted to increase infinitely without


violating feasibility condition then the solution is said to be Unbounded.
The objective function value can also be increased

infinitely. However an unbounded feasible region may yield some definite value of the objective function.

x2

An Unbounded Solution
Maximize Subjec t to x1 - x2 1 Z= 3 x1 +2 x2 x1 - x2 1 x1 + x2 3 x1 , x2 0

Unbounded feasible region

1 x1 + x2 3

x1

x2

Unbounded feasible region x1 - x2 1

Maximize Subjec t to

Z= 3 x1 +2 x2 x1 - x2 1 x1 + x2 3 x1 , x2 0

1 x1 + x2 3

x1

An Infeasible Solution
If it is not possible to find a solution that satisfies all

constraints, then linear programming problem is said to have an infeasible solution.


Infeasibility depends solely on constraints and has

nothing to do with objective function. E.g. Maximize Z= 6 x1 -4 x2


Subjec t to 2x1+4x2 4 4x1 + 8x2 16 x1 , x2 0

x2

Infeasible Solution E.g. Maximize Subjec t to Z= 6 x1 -4 x2 2x1+4x2 4 4x1 + 8x2 16 x1 , x2 0

. 3
The two inequalities that form constraints set are inconsistent. Thus there is no set of points that satisfies all the constraints. Hence there is

no feasible solution to this problem


2 4x1 + 8x2 16

1 2x1+4x2 4 x1

You might also like