Write an inequality to represent the minimum cargo weight requirement, where x is the number of shorter containers (45,600 lbs each) and y is the number of longer containers (56,000 lbs each), with a total cargo weight of at least 785,000 lbs.
Write a system of linear inequalities with two lines: a solid line starting at y=1 with slope −5/1, and a dashed line starting at y=−2 with slope 1. Represent the shaded region between the lines.
Choose a system of linear equations to represent the growth of a 4 inch per year spruce tree and a 6 inch per year hemlock tree with initial heights of 14 inches and 8 inches, respectively.
Solve the system of linear equations represented by the given augmented matrix using Gauss-Jordan method. Perform the row operations and find the values of x, y, and z.
Solve the given systems of linear equations (a) 4x1−3x2+6x3=0,2x1−x3=5,4x1=−2, (b) 4x1−x2+3x3=2,x1+3x2=5,4x2=8, (c) 5x1=10,5x2−3x3=9,4x1+x2=0, (d) a+b=3,a+b−c=0,b+c=4, (e) r+s−t=0,r+t=2,r−2s+t=2, (f) 0.6y+1.8z=3,0.3x+1.2y=0,0.5x+z=1.
Find the basis and dimension of the subspace V⊂R4 given by the homogeneous system x1+2x2+x3+2x4=0,3x1+5x2+4x3+7x4=0. Then, find the homogeneous system of linear equations that define the subspace W⊂R4 spanned by the basis of V and the vector w=(1,0,0,0).
Find the closest vector x in the subspace W spanned by v1 and v2 to the given vector y, where y=⎣⎡1−1119⎦⎤, v1=⎣⎡1−1−11⎦⎤, and v2=⎣⎡−1102⎦⎤.
Find a symmetric matrix A with non-negative eigenvalues and show that A has a symmetric square root R such that R2=A. Then, find two different square roots of the matrix B=[5−3−35].
Solve the initial tableau of a linear programming problem using the simplex method. The maximum is −3 when x1=511, x2=0, x3=411, s1=211, and s2=0.
Find the formula of a linear transformation φ:R2→R3 given by the matrix M(φ)AB=⎣⎡123231⎦⎤, where A={(1,0),(1,−1)} and B={(1,0,0),(0,1,1),(−1,0,1)}. Also, find the matrix M(φ∘ψ)AB for the linear transformation ψ:R2→R2 given by ψ((x1,x2))=(x2,x1+x2).