"r-help@r-project.org"
Subject
11/12/2008 12
Try the pseudo inverse:
m <- rbind(c(1, 1, 1), c(1, 0, 1), c(0, 1, 0))
b <- c(5, 2, 3)
library(MASS)
ginv(m) %*% b
On Thu, Dec 11, 2008 at 2:20 AM, Chris Line <[EMAIL PROTECTED]> wrote:
> I have a set of linear equations and would like to find any feasible
> solution. A simplex solution works
Hi,
in the first example, your feasible set is just one point (the one
that fulfills the 3 equations) and thus there is only this one point
which can maximize the objective function. In the second case, the
feasible set is a line. But the simplex algorithm tries to find an
optimizing value of the o
I have a set of linear equations and would like to find any feasible solution.
A simplex solution works in Case 1 below, but not in Case 2. I would be
grateful for any help.
Case 1: Find any feasible solution for the set of linear equations:
a + b + c = 5
a + b + 0c = 4
0a +
4 matches
Mail list logo
