in polygon
in [Matlab]
|
From: michael scheinfeild on 23 Feb 2010 10:45 send me link to theory development of this
From: Matt J on 23 Feb 2010 11:11 "michael scheinfeild" <yomholedet(a)gmail.com> wrote in message <hlvssr$16$1(a)fred.mathworks.com>... > also what is the theory of ax=b (i know least squares) with relation to point in polygon what is the mean of a,b matrices =================== Any polyhedral region, in any dimension, can be represented as a system of linear inequalities a11*x1+a12*x2+...<=b1 a21*x1+a22*x2+...<=b2 etc... The matrix a and vector b are just used to express these inequalities in matrix-vector form a*x<=b >send me link to theory development of this ================ You should find it in any book on convex analysis or convex optimization.
From: Matt J on 23 Feb 2010 12:12 "Matt J " <mattjacREMOVE(a)THISieee.spam> wrote in message <hm0umo$m19$1(a)fred.mathworks.com>... > Any polyhedral region, in any dimension, can be represented as a system of linear inequalities > > a11*x1+a12*x2+...<=b1 > a21*x1+a22*x2+...<=b2 > etc... Any *convex* polyhedral region, I should say...
From: michael scheinfeild on 23 Feb 2010 13:31
thanks i fond nice link http://euphrates.wpunj.edu/courses/maen509/unit04/li-2variables.htm i forgot i learned it in school before 20 years , i think i become old .... |