NetNews Usenet Archive 1992 #27/NN_1992_27.iso/spool/comp/theory/2477

Internet Message Format | 1992-11-19 | 927 b

Path: sparky!uunet!utcsri!neat.cs.toronto.edu!neto
Newsgroups: comp.theory
From: [e-mail] (David Neto)
Subject: Question about Gismondi and Swart, CIS92-D4
Message-ID: <[e-mail]>
Organization: Department of Computer Science, University of Toronto
Date: 19 Nov 92 21:59:36 GMT
Lines: 13

I've been reading the paper, and can't come up with a proof for a
particular step.  On the top of page 10, it is claimed that any
solution t to F3 is a linear combination of the q_i's, where the
coeffiecients alpha_i's add up to 1.  That is, t is in the space
spanned by all q_i's.  My question, which may be trivial (perhaps I
lack the necessary background in linear programming), is: how can we
guarantee that this solution is somewhere in this vector space?  Is it
the case that the s,t, and u constraints guarantee this, but I can't
find the reason?

Thanks,
David Neto
[e-mail]