query: Transforming a linear constraint.
positive_passages.docid: 152364
positive_passages.text: How to compute the image of a polyhedron under a linear transformation
negative_passages.docid: 20856
negative_passages.text: Inverse of Linear Transformations
negative_passages.docid: 142886
negative_passages.text: Find set with maximal cardinality given constraints
negative_passages.docid: 84014
negative_passages.text: Automated formula construction
negative_passages.docid: 60729
negative_passages.text: How do I animate constraint changes?
negative_passages.docid: 34272
negative_passages.text: Proving definition of norms induced by vector norms
negative_passages.docid: 32767
negative_passages.text: Similar Matrices and Linear Transformations
negative_passages.docid: 5772
negative_passages.text: Graphically solving a linear programming problem
negative_passages.docid: 62676
negative_passages.text: Generic method with multiple constraints
negative_passages.docid: 33851
negative_passages.text: Generalizing a sequence.
negative_passages.docid: 122691
negative_passages.text: Graphs of Linear Inequalities
negative_passages.docid: 92763
negative_passages.text: Optimising $x_1x_2+x_2x_3+\cdots+x_nx_1$ given certain constraints
negative_passages.docid: 143051
negative_passages.text: Inverting noninvertible elements in a bigger ring.
negative_passages.docid: 145885
negative_passages.text: Linear transformation preserving orthogonality
negative_passages.docid: 140225
negative_passages.text: Linear transformation maps the first quadrant to a closed set
negative_passages.docid: 76140
negative_passages.text: The supremum norm is submultiplicative
negative_passages.docid: 54719
negative_passages.text: How to handle equality constraints in this problem?