The transportation problem is a special type of linear programming problem where the objective is to minimize the cost of distributing a product from a number of sources or origins to a number of destinations.
Because of its special structure, the usual simplex method is not suitable for solving transportation problems. These problems require a special method of solution.
The transportation problem is a special type of linear programming problem where the objective is to minimize the cost of distributing a product from a number of sources or origins to a number of destinations.
Because of its special structure, the usual simplex method is not suitable for solving transportation problems. These problems require a special method of solution.
A problem is provided which is solved by using graphical and analytical method of linear programming method and then it is solved by using geometrical concept and algebraic concept of simplex method.
This presentation is trying to explain the Linear Programming in operations research. There is a software called "Gipels" available on the internet which easily solves the LPP Problems along with the transportation problems. This presentation is co-developed with Sankeerth P & Aakansha Bajpai.
By:-
Aniruddh Tiwari
Linkedin :- http://in.linkedin.com/in/aniruddhtiwari
A problem is provided which is solved by using graphical and analytical method of linear programming method and then it is solved by using geometrical concept and algebraic concept of simplex method.
This presentation is trying to explain the Linear Programming in operations research. There is a software called "Gipels" available on the internet which easily solves the LPP Problems along with the transportation problems. This presentation is co-developed with Sankeerth P & Aakansha Bajpai.
By:-
Aniruddh Tiwari
Linkedin :- http://in.linkedin.com/in/aniruddhtiwari
Gauss jordan and Guass elimination methodMeet Nayak
This ppt is based on engineering maths.
the topis is Gauss jordan and gauss elimination method.
This ppt having one example of both method and having algorithm.
performance management and Resource optimization part-2.pptxtefera21
a linear-programming algorithm that can solve problems having more than two decision variables.The simplex
technique involves generating a series of solutions in tabular form, called tableaus.
By inspecting the bottom row of each tableau, one can immediately tell if it represents the optimal solution.
Each tableau corresponds to a corner point of the feasible solution space.
The first tableau corresponds to the origin . Subsequent tableaus are developed by shifting to an adjacent corner point in the direction that yields the highest (smallest) rate of profit (cost). This process continues as long as a positive (negative) rate of cost (profit ) exists.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
Ethnobotany and Ethnopharmacology:
Ethnobotany in herbal drug evaluation,
Impact of Ethnobotany in traditional medicine,
New development in herbals,
Bio-prospecting tools for drug discovery,
Role of Ethnopharmacology in drug evaluation,
Reverse Pharmacology.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
The Art Pastor's Guide to Sabbath | Steve ThomasonSteve Thomason
What is the purpose of the Sabbath Law in the Torah. It is interesting to compare how the context of the law shifts from Exodus to Deuteronomy. Who gets to rest, and why?
How to Create Map Views in the Odoo 17 ERPCeline George
The map views are useful for providing a geographical representation of data. They allow users to visualize and analyze the data in a more intuitive manner.
Palestine last event orientationfvgnh .pptxRaedMohamed3
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
We all have good and bad thoughts from time to time and situation to situation. We are bombarded daily with spiraling thoughts(both negative and positive) creating all-consuming feel , making us difficult to manage with associated suffering. Good thoughts are like our Mob Signal (Positive thought) amidst noise(negative thought) in the atmosphere. Negative thoughts like noise outweigh positive thoughts. These thoughts often create unwanted confusion, trouble, stress and frustration in our mind as well as chaos in our physical world. Negative thoughts are also known as “distorted thinking”.
1. Special Cases in Simplex Method
Divyansh Verma
SAU/AM(M)/2014/14
South Asian University
Email : itsmedv91@gmail.com
4/18/2015 1
2. Contents
• Simplex Method
• Simplex Table
• Special Cases of Simplex Method
– Degeneracy
– Alternative Optima
– Unbounded Solution
– Infeasible Solution
• References
4/18/2015 2
3. Simplex Method
Step 1 : Determine a starting basic feasible solution.
Step 2 : Determine the entering basic variable by selecting the
non-basic variable with the most negative value (in
case of maximization) or with the most positive (in
case of minimization) in the Z-row. Stop if there is no
entering variable, the last solution is optimal.
Else, go to Step 3.
Step 3 : Select a leaving variable using the feasibility condition
Step 4 : Determine the new basic solution by using the
appropriate Gauss-Jordan computations.
Repeat Step 2.
4/18/2015 3
4. Simplex Table
Basic
Variable
X1 X2 S1 S2 S3 Solution Min
Ratio
Z C1 C2 C3 C4 C5 z -
S1 a11 a12 a13 a14 a15 b11 b11/a1j
S2 a21 a22 a23 a24 a25 b21 b21/a2j
S3 a31 a32 a33 a34 a35 b31 b31/a3j
Non-Basic Variable
Coefficient of Objective Function,
decides Entering Variable
Decides the
Leaving Variable
Objective
Function Value
Right Hand Side Value of Constraints
Z-row
S1-row
S2-row
S3-row
A format of Simplex Table for some given LPP, here Xj are Decision Variables, Sj
are Slack Variables, aij is the coefficient of Xj corresponding to ith constraint.
4/18/2015 4
5. Special Cases in Simplex
Special Cases that arise in the use of Simplex Method :
1. Degeneracy
2. Alternative Optima
3. Unbounded Solution
4. Infeasible Solution
4/18/2015 5
6. Degeneracy
A solution of the problem is said to be degenerate solution if the
value of at least one basic variable becomes zero.
In the simplex table, a tie for the minimum ratio occurs which is
broken arbitrarily.
It can cause the solution to cycle indefinitely.
Graphically, it occurs due to redundant constraint (i.e. a
constraint that can be removed from system without changing
the feasible solution).
4/18/2015 6
7. Degeneracy
For example, consider the problem
Max z = 3x1 + 9x2 ; Subject to : x1 + 4x2 ≤ 8 ; x1 + 2x2 ≤ 4 ; x1, x2 ≥ 0
4/18/2015 7
Basic
Variable
X1 X2 S1 S2 Solution Min
Ratio
Z0 -3 -9 0 0 0 -
S1 1 4 1 0 8 2
S2 1 2 0 1 4 2
Z2 -3/4 0 9/4 0 18 -
X2 1/4 1 1/4 0 2 8
S2 1/2 0 -1/2 1 0 0
Z3 0 0 3/2 3/2 18 -
X2 0 1 1/2 -1/2 2 -
X1 1 0 -1 2 0 -
Tie in Min Ratio
(Degeneracy)
X2 enters
S1 leaves
X1 enters
S2 leaves
S2 becomes zero
in next iteration
because of
degeneracy
Optimum Solution : X1=0, X2=2, Max Z=18
8. Alternative Optima
If the z-row value for one or more non-basic variable is zero in
the optimal tableau, alternate optimal solution exists.
Graphically, it happens when the objective function is parallel to
a non-redundant binding constraint (i.e. a constraint that is
satisfied as an equation at the optimal solution).
The zero coefficient of non-basic variable xi indicates that it can
be made basic, altering the value of basic variable without
changing the value of z.
4/18/2015 8
9. Alternative Optima
4/18/2015 9
For example, consider the problem
Max z = 2x1 + 4x2 ; Subject to : x1 + 2x2 ≤ 5 ; x1 + x2 ≤ 4 ; x1, x2 ≥ 0
Basic
Variable
X1 X2 S1 S2 Solution Min
Ratio
Z0 -2 -4 0 0 0 -
S1 1 2 1 0 5 5/2
S2 1 1 0 1 4 4/1
Z2 0 0 2 0 10 -
X2 1/2 1 1/2 0 5/2 5
S2 1/2 0 -1/2 1 3/2 3
Z3 0 0 2 0 10 -
X2 0 1 1 -1 1 -
X1 1 0 -1 2 3 -
Optimum Solution,
but coefficient of
non-basic variable
X1 is 0, indicates
that it can be
made basic.
X2 enters
S1 leaves
X1 enters
S2 leaves
Alternate
Optimum Solution
X1 , X1 are basic
variables.
Optimum Solution : X1=3, X2=1 Max Z=10
10. Unbounded Solution
When determining the leaving variable of any tableau, if there is
no positive minimum ratio or all entries of pivot column are
negative or zero.
4/18/2015 10
For example, consider the problem
Max z = 2x1 + x2 ; Subject to : - x1 + x2 ≤ 10 ; -2x1 ≤ 40 ; x1, x2 ≥ 0
Basic
Variable
X1 X2 S1 S2 Solution Min
Ratio
Z0 -2 -1 0 0 0 -
S1 -1 1 1 0 10 -
S2 -2 0 0 1 40 -
X1 is the entering variable
but all the constraint
coefficients under X1 are ≤
0 , meaning that X1 can be
increased indefinitely, which
gives unbounded solution.
11. Infeasible Solution
If at least one artificial variable is positive in the optimum
iteration, then the LPP has no feasible solution.
This situation obviously does not occur when all the constraints
are type ≤ with non-negative right-hand side because all slack
variables provide an obvious feasible solution.
So, this situation occurs in Big-M Method & Two-Phase Method
in which artificial variable are used.
4/18/2015 11