**Q- The Optimum of a linear programming problem occurs at $(1,2,3)$ and $(-1,0,7)$ then the optimum also occurs at?
$a)(2,4,6)$
$b)(0,3,5)$
$c)(0,1,5)$
$d)(3,2,1)$
$e)$ None of the above.
When we are given two points in the xy axis as optimum points we can simply take any point which lies on that line as other optimum solutions to the given problem.But i tried to work out the answer to this problem in the same way but i cant figure out an answer without the optimum simplex tableau.So how to find the answer to this question??**
you can construct a from the given two points a direction vector. In combination with a position vector you can proof which of the given points is on the vector.
greetings,
calculus