Question: I need help with this: Using the shortest path algorithm for graphs, but via inspection, determine if the following system of inequalities has a feasible
I need help with this:
Using the shortest path algorithm for graphs, but via inspection, determine if the following system of inequalities has a feasible solution. If it has a feasible solution, find one. Otherwise, say why it is not feasible.
x1 x3 4
x5 x1 2
x1 x2 3
x4 x3 2
x2 x4 3
x3 x2 8
x4 x5 2.
I worked on it but keep getting wrong.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
