Quiz: Linear Equations and Matrix Algebra — 64 questions

Detailed questions and answers

1. What distinguishes an algebraic expression from an equation?

An algebraic expression contains variables, while an equation contains numerical constants without variables.
An algebraic expression describes a graph, while an equation describes only a numerical calculation.
An algebraic expression links quantities through operations, while an equation asserts equality between two expressions.
An algebraic expression asserts equality between quantities, while an equation links quantities through operations.

An algebraic expression links quantities through operations, while an equation asserts equality between two expressions.

Explanation

An algebraic expression combines quantities using mathematical operations without necessarily asserting equality. An equation, by contrast, states that two expressions have equal values.

2. Which statement best defines a linear equation?

It contains variables raised to the first power along with constants or constants multiplied by those variables.
It contains at least one variable raised to a power greater than one and may include several constants.
It relates two expressions through equality but permits variables with any whole-number exponent.
It contains a variable in a denominator and combines it with constants through multiplication.

It contains variables raised to the first power along with constants or constants multiplied by those variables.

Explanation

A linear equation has variables of degree one and includes constants or constants multiplied by first-power variables. Equations with higher powers or variables in denominators do not meet this definition.

3. What does the slope of a line measure?

The change in the value of XX for a one-unit change in YY, indicating horizontal position.
The value of YY where the line crosses the vertical axis, indicating its starting height.
The change in the value of YY for a one-unit change in XX, indicating the line’s steepness.
The total distance between two points on the line, indicating the length of the graph.

The change in the value of $$Y$$ for a one-unit change in $$X$$, indicating the line’s steepness.

Explanation

Slope measures the change in YY relative to a one-unit change in XX and therefore describes how steeply the line rises or falls. The vertical-axis crossing is the intercept, not the slope.

4. In the linear form Y=mX+bY=mX+b, what do mm and bb represent?

mm is the slope and bb is the YY-intercept.
mm is the fixed cost and bb is the variable cost.
mm is the YY-intercept and bb is the slope.
mm is the dependent variable and bb is the independent variable.

$$m$$ is the slope and $$b$$ is the $$Y$$-intercept.

Explanation

In Y=mX+bY=mX+b, mm determines the rate of change and therefore is the slope, while bb is the value of YY when X=0X=0. The variables XX and YY represent the independent and dependent variables, respectively.

5. Which set of information can be used with the slope-intercept form to develop a line equation?

The line’s slope and its vertical change.
One coordinate and the line’s slope.
The line’s slope and its YY-intercept.
Two coordinates located on the line.

The line’s slope and its $$Y$$-intercept.

Explanation

The slope-intercept form is built from a slope and a YY-intercept. Two coordinates instead provide the starting information for the two-point approach, while one point and a slope support the slope-point form.

6. Which equation represents a line with slope mm and YY-intercept bb?

Y=mX+bY=mX+b
m=Y2Y1X2X1m=\frac{Y_2-Y_1}{X_2-X_1}
YY1=m(XX1)Y-Y_1=m(X-X_1)
X=constantX=\text{constant}

$$Y=mX+b$$

Explanation

The slope-intercept equation is Y=mX+bY=mX+b, where mm is the slope and bb is the YY-intercept. The other expressions represent slope-point form, the slope calculated from two points, and a vertical line.

7. A non-vertical line has slope 33 and passes through (2,5)(2,5). Which equation is its slope-point form?

Y=3X+5Y=3X+5
Y5=3(X2)Y-5=3(X-2)
Y+5=3(X+2)Y+5=3(X+2)
Y2=3(X5)Y-2=3(X-5)

$$Y-5=3(X-2)$$

Explanation

Substituting m=3m=3, X1=2X_1=2, and Y1=5Y_1=5 into YY1=m(XX1)Y-Y_1=m(X-X_1) gives Y5=3(X2)Y-5=3(X-2). The expression Y=3X+5Y=3X+5 incorrectly treats the point’s YY-coordinate as the intercept.

8. How can a line be identified as horizontal rather than vertical?

Its slope is negative, so its equation has a changing XX-value.
Its slope is positive, so its equation has a changing YY-value.
Its points have the same XX-coordinate, so its equation is X=constantX=\text{constant}.
Its points have the same YY-coordinate, so its equation is Y=constantY=\text{constant}.

Its points have the same $$Y$$-coordinate, so its equation is $$Y=\text{constant}$$.

Explanation

A horizontal line keeps YY constant while XX changes, so it has the form Y=constantY=\text{constant}. Equal XX-coordinates instead characterize a vertical line.

9. Which expression correctly represents total cost in terms of total variable cost and total fixed cost?

TC=VC×FCTC=VC\times FC
TC=VC+FCTC=VC+FC
TC=FCVCTC=FC-VC
TC=VCFCTC=VC-FC

$$TC=VC+FC$$

Explanation

Total cost is the sum of variable and fixed costs, so TC=VC+FCTC=VC+FC. Fixed cost does not get subtracted from variable cost or multiplied by it in this definition.

10. A business sells each unit for PP and sells QQ units. Which pair of formulas gives total revenue and profit?

TR=PQTR=\frac{P}{Q} and Π=TR+TC\Pi=TR+TC
TR=P+QTR=P+Q and Π=TCTR\Pi=TC-TR
TR=PQTR=PQ and Π=TRTC\Pi=TR-TC
TR=TCPQTR=TC-PQ and Π=TR+TC\Pi=TR+TC

$$TR=PQ$$ and $$\Pi=TR-TC$$

Explanation

Sales revenue equals unit price multiplied by quantity, TR=PQTR=PQ, and profit equals revenue minus total cost, Π=TRTC\Pi=TR-TC. Fixed or total costs are not added to revenue to calculate profit.

11. In a linear cost model, what happens to average fixed cost as production quantity increases?

It decreases because the fixed cost is spread across more units.
It becomes equal to marginal cost because variable cost is constant per unit.
It increases because producing more units raises total fixed cost.
It remains constant because fixed cost does not vary with output.

It decreases because the fixed cost is spread across more units.

Explanation

Average fixed cost falls as quantity increases because the same fixed cost is allocated across more units. Fixed cost itself remains constant, but its per-unit average does not.

12. A company reaches its break-even point when which condition holds?

Total variable cost equals total fixed cost, so production becomes cost-free.
Unit selling price equals total revenue, so the company covers each expense.
Total revenue equals total cost, so the company makes neither profit nor loss.
Total revenue exceeds total cost, so the company earns its maximum profit.

Total revenue equals total cost, so the company makes neither profit nor loss.

Explanation

At break-even, total revenue and total cost are equal, producing zero profit and zero loss. A revenue amount greater than total cost would instead indicate a profit.

13. What distinguishes a matrix from a scalar?

A matrix is a rectangular array of numbers, whereas a scalar is one real number
A matrix is one real number, whereas a scalar is a rectangular array of numbers
A matrix is a square array, whereas a scalar is any rectangular array
A matrix is a list of variables, whereas a scalar is a geometric vector

A matrix is a rectangular array of numbers, whereas a scalar is one real number

Explanation

A matrix contains numbers arranged in rows and columns, while a scalar is a single real number. Confusing a matrix with a scalar reverses these two definitions.

14. In a matrix, what does the element aija_{ij} identify?

The entry on diagonal position i+ji+j
The entry in row jj and column ii
The entry in row ii and column jj
The entry in the matrix's iith column and jjth row

The entry in row $$i$$ and column $$j$$

Explanation

The first subscript gives the row and the second gives the column, so aija_{ij} is in row ii and column jj. Reversing the subscripts changes the element's location.

15. Which statement correctly describes an identity matrix?

It is square, has ones on the main diagonal, and leaves conformable matrices unchanged under multiplication
It is rectangular, has ones in every position, and leaves matrices unchanged under addition
It is diagonal, has arbitrary diagonal entries, and produces a zero matrix under multiplication
It is square, has zeros on the main diagonal, and changes matrix dimensions under multiplication

It is square, has ones on the main diagonal, and leaves conformable matrices unchanged under multiplication

Explanation

An identity matrix is square with ones on its primary diagonal and zeros elsewhere, and it acts as a multiplicative identity. A rectangular matrix with ones throughout does not have this property.

16. Two matrices can be added or subtracted when which condition holds?

They have the same number of rows and the same number of columns
They are both square, even if their dimensions differ
Their corresponding entries are equal before the operation
The first matrix has as many columns as the second matrix has rows

They have the same number of rows and the same number of columns

Explanation

Addition and subtraction require equal dimensions, after which corresponding entries are combined. Matching the first matrix's columns to the second matrix's rows is the condition for multiplication instead.

17. If a scalar XX multiplies a matrix AA, which equality expresses commutativity of scalar multiplication?

XA=X+AXA=X+A
XA=AXXA=A-X
XA=A+XXA=A+X
XA=AXXA=AX

$$XA=AX$$

Explanation

A real scalar can be placed on either side of a matrix without changing the scalar-matrix product, so XA=AXXA=AX. The additive expressions do not represent scalar multiplication.

18. Which equation correctly applies distributivity to a scalar multiplying a matrix sum?

(X+Y)A=XYA(X+Y)A=XYA
X(A+B)=XA+XBX(A+B)=XA+XB
X(A+B)=X+A+BX(A+B)=X+A+B
X(A+B)=AB+XX(A+B)=AB+X

$$X(A+B)=XA+XB$$

Explanation

Scalar multiplication distributes across matrix addition, giving X(A+B)=XA+XBX(A+B)=XA+XB. Combining the scalars as XYAXYA applies to a different expression involving scalar multiplication.

19. If AA has dimension 4×34\times 3 and BB has dimension 3×23\times 2, what is the dimension of ABAB?

3×33\times 3
2×42\times 4
4×34\times 3
4×24\times 2

$$4\times 2$$

Explanation

The inner dimensions, 33 and 33, match, so the product is conformable and has the outer dimensions 4×24\times 2. The other dimensions either preserve an input size or reverse the outer dimensions.

20. Which statement correctly characterizes matrix multiplication?

It is associative and distributive, but it is not generally commutative
It is commutative and associative, but it does not distribute over addition
It is generally neither associative nor distributive
It is distributive and commutative, but it is not associative

It is associative and distributive, but it is not generally commutative

Explanation

Matrix multiplication satisfies associativity and distributivity, but products may depend on order, so ABAB does not generally equal BABA. Treating matrix multiplication like ordinary scalar multiplication creates the commutativity error.

21. For a square matrix AA, what condition defines A1A^{-1} as its inverse?

AA1=IAA^{-1}=I while A1A=0A^{-1}A=0
AA1=A1A=IAA^{-1}=A^{-1}A=I
AA1=AAA^{-1}=A and A1A=A1A^{-1}A=A^{-1}
AA1=A1A=0AA^{-1}=A^{-1}A=0

$$AA^{-1}=A^{-1}A=I$$

Explanation

An inverse is defined by producing the identity matrix on both sides, so AA1=A1A=IAA^{-1}=A^{-1}A=I. A zero product does not establish that a matrix is invertible.

22. How does an invertible matrix differ from a singular matrix?

An invertible matrix has no inverse, whereas a singular matrix has a unique inverse
An invertible matrix has determinant zero, whereas a singular matrix has an identity inverse
An invertible matrix must be rectangular, whereas a singular matrix must be square
An invertible matrix has an inverse, whereas a singular matrix has no inverse

An invertible matrix has an inverse, whereas a singular matrix has no inverse

Explanation

An invertible, or nonsingular, matrix possesses an inverse, while a singular matrix does not. The determinant and shape claims in the other choices do not state this distinction correctly.

23. Which statement about matrix inverses is correct?

Only diagonal matrices can have inverses, and their inverses need not be unique
Any matrix with a zero entry has an inverse, and that inverse is unique
Every rectangular matrix has an inverse, and it may have several inverses
Only square matrices can have inverses, and an existing inverse is unique

Only square matrices can have inverses, and an existing inverse is unique

Explanation

Inverses are defined for square matrices, and whenever an inverse exists it is unique. Rectangular shape and diagonal structure are not sufficient conditions for invertibility.

24. What is the standard row-operation procedure for finding the inverse of a square matrix AA?

Augment AA with II, row-reduce the left side to II, and read the inverse on the right
Augment AA with a zero matrix, row-reduce the right side to II, and read the inverse on the left
Add the rows of AA together and place the resulting vector beside the original matrix
Multiply AA by itself until the left side becomes zero, then use the resulting matrix

Augment $$A$$ with $$I$$, row-reduce the left side to $$I$$, and read the inverse on the right

Explanation

The augmented matrix [AI][A\mid I] is transformed through elementary row operations into [IA1][I\mid A^{-1}]. Reducing the right side or using a zero matrix does not implement the inverse-finding method.

25. Which sequence correctly describes the inverse method for solving AX=BAX=B?

Substitute each constant into the equations, eliminate variables, and verify A=BA=B
Augment AA with BB, row-reduce to identity form, and read off XX
Convert to matrix form, find A1A^{-1}, and compute X=A1BX=A^{-1}B
Find the determinant of BB, invert BB, and compute X=B1AX=B^{-1}A

Convert to matrix form, find $$A^{-1}$$, and compute $$X=A^{-1}B$$

Explanation

The inverse method solves the system by obtaining the inverse of the coefficient matrix and multiplying it by the constant vector. Row reduction describes Gaussian elimination rather than the inverse method.

26. For which coefficient matrix can the inverse method be applied to a system AX=BAX=B?

A square matrix that is invertible
A square matrix whose determinant equals zero
A rectangular matrix with dependent columns
A coefficient matrix from any consistent system

A square matrix that is invertible

Explanation

The inverse method requires a square coefficient matrix with an inverse. A zero determinant means the matrix is not invertible, and consistency alone does not guarantee that the inverse method applies.

27. What does Gaussian elimination do after adjoining the constant vector to a coefficient matrix?

It applies elementary row operations to reveal the solution type
It multiplies the coefficient matrix by its own transpose
It replaces every equation with a probability transition rule
It calculates the inverse of the constant vector before solving

It applies elementary row operations to reveal the solution type

Explanation

Gaussian elimination augments the coefficient matrix with the constants and uses elementary row operations to reach a revealing form. Computing an inverse is associated with the inverse method, not the defining step of Gaussian elimination.

28. A reduced augmented matrix contains a row whose coefficient entries are all zero while its constant entry is nonzero; what does this show?

The system requires an inverse coefficient matrix
The system has infinitely many solutions
The system has exactly one solution
The system has no solution

The system has no solution

Explanation

A zero coefficient row paired with a nonzero constant represents a contradiction, so the system has no solution. Free variables in a consistent system, rather than a contradiction, indicate infinitely many solutions.

29. Which procedure best represents a word problem as a solvable algebraic model?

Assign every quantity a different variable, substitute randomly, and simplify
Choose numerical values, form a matrix, invert it, and accept the result
Solve each sentence separately, ignore units, and compare the final numbers
Define an unknown, express related quantities, form equations, solve, and check

Define an unknown, express related quantities, form equations, solve, and check

Explanation

A reliable solution defines an unknown, relates other quantities to it, translates the information into equations, solves, and checks the result against the statement. Omitting the check can preserve an algebraic result that does not fit the original conditions.

30. What does a Markov chain model?

How a system evolves through time using transition probabilities between states
How a fixed equation produces a single output from a selected input
How a database stores unrelated records without temporal relationships
How a geometric figure changes shape under a sequence of reflections

How a system evolves through time using transition probabilities between states

Explanation

A Markov chain is a probabilistic model of repeated changes between states, described by transition probabilities. A fixed input-output equation does not capture the state-to-state evolution that defines a Markov chain.

31. What information determines the state of a Markov system during a given period?

The number of periods elapsed without any state information
The long-run equilibrium distribution without the preceding state
The preceding state together with the transition probabilities
The initial state alone, regardless of transition probabilities

The preceding state together with the transition probabilities

Explanation

The Markov rule uses the preceding state and the transition probabilities to determine the next period's state distribution. The long-run distribution describes eventual behavior but does not replace the preceding state in the step-by-step update.

32. What is the transition probability from state ii to state jj?

The probability that the system began in state ii at the first period
The fraction of time eventually spent in state jj after equilibrium
The total number of transitions observed between all pairs of states
The likelihood of moving from state ii to state jj in the next period

The likelihood of moving from state $$i$$ to state $$j$$ in the next period

Explanation

A transition probability measures the likelihood of moving from the current state ii to state jj during the next period. A long-run fraction describes a steady-state distribution rather than a single-period transition.

33. If a row state vector is used, how is the next state vector calculated from the current vector?

V(n)=PV(n1)V(n)=PV(n-1)
V(n)=V(n1)+PV(n)=V(n-1)+P
V(n)=V(n1)PV(n)=V(n-1)P
V(n)=P1V(n1)V(n)=P^{-1}V(n-1)

$$V(n)=V(n-1)P$$

Explanation

With row state vectors, the next vector is obtained by multiplying the previous vector on the right by the transition matrix, giving V(n)=V(n1)PV(n)=V(n-1)P. Left multiplication corresponds to a different vector convention and is not the stated rule here.

34. What is the long-run distribution in the two-store example?

One-third of customers are at store 1 and two-thirds at store 2
Half of the customers are at each store after many periods
Two-thirds of customers are at store 1 and one-third at store 2
All customers eventually concentrate at store 1

Two-thirds of customers are at store 1 and one-third at store 2

Explanation

The stated steady-state distribution places two-thirds of customers at store 1 and one-third at store 2. Equal shares and complete concentration at one store are different long-run distributions.

35. What do decision variables represent in a linear programming model?

Unknown controllable quantities that the decision maker must determine
Fixed numerical effects assigned to resources and production activities
Restrictions that limit which proposed actions are feasible
Outcomes showing the unused portion of each scarce resource

Unknown controllable quantities that the decision maker must determine

Explanation

Decision variables are the unknown controllable quantities whose values the decision maker selects. Fixed numerical effects are parameters, while restrictions are constraints and unused resources are slack.

36. Which statement best describes the objective of a linear programming model?

It balances two unrelated quantities by optimizing both at once
It lists the controllable quantities that management must choose
It identifies every legal and contractual restriction on decisions
It optimizes one measurable quantity, such as profit or cost

It optimizes one measurable quantity, such as profit or cost

Explanation

A linear programming model has one objective, which may involve maximizing profit or minimizing cost. Constraints describe restrictions, and decision variables identify the quantities being chosen.

37. Which set contains the main assumptions of linear programming models?

Linearity, divisibility, certainty, and non-negativity
Scarcity, competition, forecasting, and market equilibrium
Continuity, randomness, integrality, and unrestricted values
Profitability, flexibility, uncertainty, and proportionality

Linearity, divisibility, certainty, and non-negativity

Explanation

The standard assumptions are linearity, divisibility, certainty, and non-negativity. The other sets include concepts that are not the model's four main assumptions.

38. A factory cannot exceed its available machine hours or violate a production policy; how are these limits represented in a linear programming model?

As decision variables selected by the production manager
As parameters measuring the objective's contribution
As objective terms measuring the value of production
As constraints restricting feasible courses of action

As constraints restricting feasible courses of action

Explanation

Constraints represent restrictions such as scarce machine hours and company policies, thereby limiting feasible decisions. Decision variables are the quantities chosen, while objective terms measure what is optimized.

39. Which sequence correctly describes the main steps in formulating a linear programming model?

Specify constraints, calculate slack, choose corners, and then define the problem
Define the problem, identify variables, state the objective, and specify constraints
Choose production quantities, maximize profit, plot results, and formalize the problem
Identify the objective, solve graphically, define variables, and estimate parameters

Define the problem, identify variables, state the objective, and specify constraints

Explanation

Formulation begins by defining the problem, then identifies decision variables, specifies the objective function, and identifies constraints. Solving and evaluating corner points occur after formulation.

40. In the microcomputer model, what does the objective function Z=60X1+50X2Z=60X_1+50X_2 represent?

The available capacity of the two production resources
The maximum number of computers demanded each week
Machine hours required to produce the two computer types
Weekly profit from producing the two computer types

Weekly profit from producing the two computer types

Explanation

The objective coefficients represent weekly profit contributions, so the expression measures total weekly profit from the two computer types. The inequalities describe resource limits rather than the objective.

41. Why must the microcomputer model include X1,X20X_1,X_2\ge0?

Negative production quantities are not meaningful decisions
Both computer types must be produced in equal quantities
The objective function must contain two positive coefficients
The production resources must remain unused after production

Negative production quantities are not meaningful decisions

Explanation

Non-negativity requires each decision variable to be zero or positive because negative production quantities are unrealistic. It does not require equal production or unused resources.

42. What distinguishes the graphical method from the algebraic simplex method in terms of problem size?

Simplex handles one objective, while the graphical method handles two
Both methods require exactly two variables to produce a solution
The graphical method handles many variables, while simplex handles two
The graphical method handles two variables, while simplex handles more than two

The graphical method handles two variables, while simplex handles more than two

Explanation

Graphical analysis is limited to linear programs with two decision variables, whereas the simplex method can address problems with more variables. Both methods can optimize a single objective.

43. Which procedure correctly identifies an optimum using the graphical method?

Find every point on the graph, compare variable values, and select the most balanced point
Plot the objective alone, select its highest intercept, and ignore constraint intersections
List resource amounts, calculate averages, and choose the largest production quantity
Plot constraints, find the feasible region, evaluate its corner points, and choose the best value

Plot constraints, find the feasible region, evaluate its corner points, and choose the best value

Explanation

The graphical method plots the constraints, identifies their common feasible region, and evaluates corner points using the objective function. The best maximum or minimum value determines the optimum.

44. Why can an optimal solution to a linear programming problem be found at a corner point of its feasible region?

At least one optimum occurs at an extreme point when an optimum exists
Corner points are the only points that satisfy every linear constraint
The objective function has a different value at every feasible point
Interior points cannot represent nonnegative decision variables

At least one optimum occurs at an extreme point when an optimum exists

Explanation

For a linear programming problem with an optimum, at least one optimal solution occurs at an extreme or corner point. Feasible interior points can also satisfy the constraints, and objective values need not differ at every point.

45. What characterizes a binding constraint in a linear programming solution?

It has zero slack and limits the solution
It has positive slack and exceeds the requirement
It measures profit above the objective target
It applies to a greater-than-or-equal-to requirement

It has zero slack and limits the solution

Explanation

A binding constraint is exactly satisfied, so its slack is zero and it restricts the feasible solution. A nonbinding constraint instead has positive slack, meaning some resource or allowance remains unused.

46. A production plan exceeds a required minimum of 120 units by 15 units under a greater-than-or-equal-to constraint. What is the surplus?

120 units
105 units
135 units
15 units

15 units

Explanation

Surplus measures how much the achieved amount exceeds the required minimum, so it equals 135120=15135-120=15 units. Slack is associated with a less-than-or-equal-to constraint, not this greater-than-or-equal-to requirement.

47. Which description best defines the simplex method?

An iterative procedure that improves a feasible solution until no further improvement is possible
A graphical procedure that evaluates every point in the feasible region before choosing one
A calculation that begins with an arbitrary solution and corrects violations afterward
A substitution method that solves the objective equation without checking constraints

An iterative procedure that improves a feasible solution until no further improvement is possible

Explanation

The simplex method starts from a feasible solution and repeatedly improves it until the stopping condition shows that no further improvement is available. An arbitrary starting point can violate constraints, so it does not meet the method's required starting condition.

48. What distinguishes a basic feasible solution from a basic solution?

A basic solution must satisfy non-negativity, while feasibility ignores the remaining constraints
A basic feasible solution is obtained from objective coefficients without using constraints
A basic feasible solution also satisfies all constraints, including non-negativity
A basic solution always gives the best objective value, while feasibility concerns resource use

A basic feasible solution also satisfies all constraints, including non-negativity

Explanation

A basic feasible solution is a basic solution that satisfies every constraint, including non-negativity conditions. A basic solution may come from the constraint equations without meeting all those restrictions.

49. In a maximization simplex problem with less-than-or-equal-to constraints, what sequence correctly describes the main procedure?

Graph the constraints, discard the tableau, and compare only the intercepts of the feasible region
Replace the objective function with inequalities, select the smallest coefficient, and stop after one pivot
Choose the final variables, eliminate all constraints, and calculate profit from the original equations
Convert to standard form, build a tableau, pivot through selected variables, and recompute CjZjC_j-Z_j

Convert to standard form, build a tableau, pivot through selected variables, and recompute $$C_j-Z_j$$

Explanation

The simplex procedure standardizes the model, creates an initial tableau, selects entering and leaving variables, performs pivot row operations, and recalculates CjZjC_j-Z_j. It repeats these steps rather than stopping after one pivot or relying on graphical intercepts.

50. When is a maximization simplex tableau optimal?

When every entry in the CjZjC_j-Z_j row is zero or negative
When each basic variable has a positive reduced cost
When the objective value becomes zero after the first pivot
When every entry in the CjZjC_j-Z_j row is positive or zero

When every entry in the $$C_j-Z_j$$ row is zero or negative

Explanation

For a maximization problem, the tableau is optimal when the CjZjC_j-Z_j row contains no positive values. A positive entry would indicate that an improvement is still possible through another entering variable.

51. What is the optimal production plan in the lawn-mower application?

24 push-type mowers and 42 self-propelled mowers, earning Br. 3600
42 push-type mowers and 24 self-propelled mowers, earning Br. 4020
18 push-type mowers and 48 self-propelled mowers, earning Br. 4020
24 push-type mowers and 42 self-propelled mowers, earning Br. 4020

24 push-type mowers and 42 self-propelled mowers, earning Br. 4020

Explanation

The optimal lawn-mower plan produces 24 push-type and 42 self-propelled mowers for a profit of Br. 4020. It leaves 9 engines unused, while assembly and packing resources are fully used.

52. What happens to woodworking capacity in the optimal bentwood furniture plan?

Eight woodworking hours remain unused after producing 13 rocking chairs and 4 coffee tables
All woodworking hours are used after producing 13 rocking chairs and 4 coffee tables
Eight woodworking hours remain unused after producing 13 tables and 4 rocking chairs
Eight woodworking hours are added after producing 4 rocking chairs and 13 coffee tables

Eight woodworking hours remain unused after producing 13 rocking chairs and 4 coffee tables

Explanation

The optimal plan produces 13 rocking chairs and 4 coffee tables, achieves a maximum profit of Br. 648, and leaves 8 woodworking hours unused. The unused woodworking capacity shows that other resources determine the limiting combination.

53. What production plan minimizes operating cost in the tire-machine application?

40 tires on machine I and 20 tires on machine II, at a cost of Br. 4020
40 tires on machine I and 20 tires on machine II, at a cost of Br. 3600
20 tires on machine I and 40 tires on machine II, at a cost of Br. 3600
30 tires on machine I and 30 tires on machine II, at a cost of Br. 3600

40 tires on machine I and 20 tires on machine II, at a cost of Br. 3600

Explanation

The minimum operating cost of Br. 3600 is obtained by producing 40 tires on machine I and 20 tires on machine II. Reversing the machine assignments changes the production plan and is not the stated cost-minimizing solution.

54. What does interest represent in a lending or investment transaction?

The total amount repaid before subtracting the principal
The price paid for using money over a period of time
The number of periods required to repay the borrowed amount
The original amount lent, invested, or borrowed

The price paid for using money over a period of time

Explanation

Interest is the cost of using money over time and is generally expressed as a percentage of the principal. The principal is the original amount, so it is not the payment for using the money.

55. What is the key difference between simple interest and compound interest?

Simple interest uses accrued interest, while compound interest uses the initial principal
Simple interest uses periodic rates, while compound interest uses annual rates
Simple interest applies to investments, while compound interest applies to loans
Simple interest uses the initial principal, while compound interest also uses accrued interest

Simple interest uses the initial principal, while compound interest also uses accrued interest

Explanation

Simple interest is calculated on the original principal, whereas compound interest is calculated on the principal plus interest accumulated in earlier periods. The distinction concerns the interest base, not whether the transaction is a loan or investment.

56. An account earns simple interest at an annual rate of 6%6\% for 33 years on a principal of Br. 2,000\mathrm{Br.}\ 2{,}000. What maturity amount does it produce?

Br. 2,600\mathrm{Br.}\ 2{,}600
Br. 2,360\mathrm{Br.}\ 2{,}360
Br. 2,120\mathrm{Br.}\ 2{,}120
Br. 2,380\mathrm{Br.}\ 2{,}380

$$\mathrm{Br.}\ 2{,}360$$

Explanation

Using A=P(1+rt)A=P(1+rt) gives A=2,000(1+0.06×3)=Br. 2,360A=2{,}000(1+0.06\times3)=\mathrm{Br.}\ 2{,}360. The interest is based on the original principal rather than on previously earned interest.

57. Which expression gives the present value of a compound amount due after nn conversion periods?

P=A(1+i)n1iP=A\frac{(1+i)^n-1}{i}
P=A(1+i)nP=A(1+i)^n
P=A(1+i)nP=A(1+i)^{-n}
P=Ai(1+i)n1P=A\frac{i}{(1+i)^n-1}

$$P=A(1+i)^{-n}$$

Explanation

Present value discounts the future amount back to the present, so the compound growth factor is raised to a negative exponent. The positive exponent expression calculates a future amount from a present principal.

58. When are payments made in an ordinary annuity?

At irregular dates throughout the payment term
At the end of each payment period
At the midpoint of each payment period
At the beginning of each payment period

At the end of each payment period

Explanation

An ordinary annuity consists of equal payments made at the end of each period. Payments at the beginning describe an annuity due, not an ordinary annuity.

59. An ordinary annuity pays Br. 500\mathrm{Br.}\ 500 per period for nn periods at a periodic interest rate of ii. Which formula gives its future value?

A=500(1+i)nA=500(1+i)^{-n}
A=500(1+i)n1iA=500\frac{(1+i)^n-1}{i}
A=5001(1+i)niA=500\frac{1-(1+i)^{-n}}{i}
A=500i(1+i)n1A=500\frac{i}{(1+i)^n-1}

$$A=500\frac{(1+i)^n-1}{i}$$

Explanation

The future value of an ordinary annuity is found by accumulating each equal payment to the end of the term, giving A=R(1+i)n1iA=R\frac{(1+i)^n-1}{i}. The expression involving 1(1+i)n1-(1+i)^{-n} calculates an annuity's present value.

60. Depositing Br. 100\mathrm{Br.}\ 100 at the end of each quarter for one year at 4%4\% compounded quarterly produces approximately what future value?

Br. 400.00\mathrm{Br.}\ 400.00
Br. 406.04\mathrm{Br.}\ 406.04
Br. 416.24\mathrm{Br.}\ 416.24
Br. 404.00\mathrm{Br.}\ 404.00

$$\mathrm{Br.}\ 406.04$$

Explanation

The four end-of-quarter deposits earn interest for different lengths of time, producing a future value of approximately Br. 406.04\mathrm{Br.}\ 406.04. Treating the deposits as earning no interest would give Br. 400.00\mathrm{Br.}\ 400.00.

61. What is the purpose of a sinking fund?

To retire an existing debt through equal periodic payments
To accumulate a definite future amount through equal periodic deposits
To calculate interest on an original principal during a loan
To discount future payments to their value at the beginning

To accumulate a definite future amount through equal periodic deposits

Explanation

A sinking fund receives equal deposits to build a specified amount by a specified date. Retiring an existing debt through regular payments is amortization, which has a different purpose.

62. A sinking fund must accumulate a target amount AA in nn periods at rate ii per period. Which formula gives the required periodic deposit?

R=A1(1+i)niR=A\frac{1-(1+i)^{-n}}{i}
R=A(1+i)n1iR=A\frac{(1+i)^n-1}{i}
R=Ai1(1+i)nR=A\frac{i}{1-(1+i)^{-n}}
R=Ai(1+i)n1R=A\frac{i}{(1+i)^n-1}

$$R=A\frac{i}{(1+i)^n-1}$$

Explanation

The sinking-fund deposit is obtained by dividing the target amount by the future-value factor for an ordinary annuity, yielding R=Ai(1+i)n1R=A\frac{i}{(1+i)^n-1}. The annuity present-value factor applies when valuing a stream of payments at the beginning of the term.

63. What does amortization describe?

Accumulating equal deposits to a specified date without reducing debt
Finding the current value of payments scheduled for future periods
Retiring a debt over time through equal payments that include compound interest
Building a future fund through deposits toward a specified target

Retiring a debt over time through equal payments that include compound interest

Explanation

Amortization retires a debt through equal periodic payments containing both interest and repayment of principal. A sinking fund builds a future balance, whereas amortization reduces an existing loan balance.

64. A loan has present value PP, periodic rate ii, and nn equal payments. Which formula gives the amortization payment?

R=Pi1(1+i)nR=P\frac{i}{1-(1+i)^{-n}}
R=P(1+i)nR=P(1+i)^{-n}
R=P1(1+i)niR=P\frac{1-(1+i)^{-n}}{i}
R=Pi(1+i)n1R=P\frac{i}{(1+i)^n-1}

$$R=P\frac{i}{1-(1+i)^{-n}}$$

Explanation

The amortization payment is the payment that makes the present value of the payment stream equal to the loan amount, so R=Pi1(1+i)nR=P\frac{i}{1-(1+i)^{-n}}. The sinking-fund formula uses the future accumulation factor and applies to building a target fund.

Review with flashcards

Memorize the answers with 94 flashcards on Linear Equations and Matrix Algebra.

What is an algebraic expression?

A mathematical statement linking numerical quantities by operations.

What does an equation indicate about two algebraic expressions?

They are equal.

What characterizes a linear equation's variables?

They have degree one.

See flashcards →

Read the study sheet

Read the complete study sheet on Linear Equations and Matrix Algebra.

See study sheet →

Similar courses

Create your own quizzes

Import your course and AI generates quizzes with corrections in 30 seconds.

Quiz generator