How? How can the equations I provided be transformed as input to the simplex algorithm (s.a.)? Are there any other objectives other than maximimze or minimize with s.a.? As I don't need either. Also, what happens with s.a. when number of equations is less than Ndim?
One day I was contemplating about different supermarkets having different prices for same products and asked "for X money where do you buy more olives and less fetta?"
In reply to Re^2: The intersection of M hyperplanes (Ndim)
by bliako
in thread The intersection of M hyperplanes (Ndim)
by bliako
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |