Setting Up Linear Programming Problems - Finite Mathematics

Let $x$ be the tons of Type A material and $y$ be the tons of Type B material. The center's goal is to maximize daily profit. Which of the following is the complete set of constraints for this problem?
Answer: $\begin{cases} x + y \le 100 \\ 3x + 6y \le 480 \\ y \ge 0.5x \\ x \ge 0, y \ge 0 \end{cases}$ The total tonnage processed cannot exceed 100: $x + y \le 100$ . The total sorting time cannot exceed 480 minutes: $3x + 6y \le 480$ . The local regulation states that Type B ( $y$ ) cannot be less than (is greater than or equal to) half of Type A ( $0.5x$ ), so $y \ge 0.5x$ . Non-negativity constraints are $x \ge 0, y \ge 0$ . This system matches option B. Distractor A incorrectly represents the regulation as $y \ge 2x$ . Distractor C incorrectly uses profit coefficients in the tonnage constraint and reverses the variables in the regulation constraint. Distractor D uses hours instead of minutes for the time constraint and reverses the inequality in the regulation constraint.
In formulating this as a linear programming problem with $b$ = BasicTab units and $t$ = ProTab units, which statement about the constraints is false?
Answer: The supplier limitation constraint should be written as $t \geq 75$ The correct answer is D. The supplier agreement limits ProTab orders to at most 75 units, so the constraint should be $t \leq 75$ , not $t \geq 75$ . Choice D incorrectly states ≥ 75, which would require at least 75 ProTab units rather than limiting to at most 75 units. Choice A correctly represents storage: 2 cubic feet per BasicTab + 3 cubic feet per ProTab ≤ 600 total cubic feet. Choice B correctly represents the investment limit: $200 per BasicTab + $450 per ProTab ≤ $40,000. Choice C correctly represents the minimum BasicTab requirement of at least 30 units.
Which system of constraints correctly represents this linear programming problem if $x$ represents the number of chairs and $y$ represents the number of tables?
Answer: $3x + 4y \leq 240$ , $2x + 3y \leq 180$ , $x \leq 50$ , $y \geq 0.5x$ , $x \geq 0$ , $y \geq 0$ The correct answer is A. Assembly constraint: 3 hours per chair + 4 hours per table ≤ 240 hours gives $3x + 4y \leq 240$ . Finishing constraint: 2 hours per chair + 3 hours per table ≤ 180 hours gives $2x + 3y \leq 180$ . Storage constraint limits chairs to 50: $x \leq 50$ . Market demand requires tables ≥ half the chairs: $y \geq 0.5x$ . Choice B incorrectly reverses the market constraint to $x \geq 0.5y$ . Choice C swaps the coefficients in both resource constraints. Choice D incorrectly applies the storage limit to tables instead of chairs.
A manufacturing plant produces electric motors and generators. Each motor requires 4 hours on Machine A and 6 hours on Machine B. Each generator requires 8 hours on Machine A and 3 hours on Machine B. Machine A is available for 320 hours per week and Machine B is available for 240 hours per week. The plant must produce at least 15 motors weekly to fulfill standing orders. Additionally, environmental regulations limit the combined weekly production to at most 50 units total. Motors sell for $800 each and generators sell for $1200 each. In the linear programming setup, what does the constraint $m + g \leq 50$ represent?
Answer: The environmental regulation limiting combined production to 50 units maximum The correct answer is B. The constraint $m + g \leq 50$ represents the environmental regulation that limits the total combined production of motors and generators to at most 50 units per week. Choice A is incorrect because machine hours would involve the time coefficients (4, 6, 8, 3), not just $m + g$ . Choice C is wrong because the constraint uses ≤, indicating a maximum limit, not a minimum requirement (which would use ≥). Choice D is incorrect because costs would involve the selling prices ($800, $1200) as coefficients, not the simple sum $m + g$ .
Let $x$ be the number of units of Model A and $y$ be the number of units of Model B. The objective is to maximize profit. Which is the correct system of constraints?
Answer: $\begin{cases} 15x + 12y \le 480 \\ x+y \le 200 \\ x \ge 10 \\ y \ge 15 \end{cases}$ The total production time cannot exceed 480 minutes: $15x + 12y \le 480$ . The total number of components used cannot exceed 200: $x + y \le 200$ . The minimum demand for Model A is 10 units: $x \ge 10$ . The minimum demand for Model B is 15 units: $y \ge 15$ . The system in A correctly represents all these constraints. Distractor B swaps the coefficients and bounds for the time and component constraints. Distractor C incorrectly uses profit values as coefficients in the time constraint. Distractor D uses hours instead of minutes for the time constraint and reverses the inequalities for the demand constraints.
Let $s$ be the number of Standard kits and $d$ be the number of Deluxe kits. Which of the following is a complete and correct set of constraints for this problem?
Answer: $\begin{cases} s + d \ge 100 \\ d \le s + 20 \\ s \le 80 \\ s \ge 0, d \ge 0 \end{cases}$ The total number of kits must be at least 100: $s + d \ge 100$ . The number of Deluxe kits ( $d$ ) cannot exceed the number of Standard kits ( $s$ ) by more than 20. This can be written as $d - s \le 20$ , which rearranges to $d \le s + 20$ . The number of Standard kits must be no more than 80: $s \le 80$ . Finally, non-negativity constraints are $s \ge 0, d \ge 0$ . This matches system A. Distractor B uses the wrong inequality for the total production and incorrectly formulates the relationship between $s$ and $d$ . Distractor C misinterprets 'Deluxe kits cannot exceed Standard kits by more than 20' as $s \le d+20$ . Distractor D reverses the inequality for the relationship between $s$ and $d$ .
A bakery produces artisan bread and pastries. Each loaf of bread requires 0.5 kg of flour and 0.2 hours of baking time. Each batch of pastries requires 0.3 kg of flour and 0.4 hours of baking time. The bakery has 60 kg of flour and 30 hours of baking time available daily. Due to oven capacity, bread production is limited to 80 loaves per day. The bakery's contract with a local café requires delivering at least 40 batches of pastries daily. If $b$ represents loaves of bread and $p$ represents batches of pastries, which constraint represents the flour limitation?
Answer: $0.5b + 0.3p \leq 60$ The correct answer is A. Each loaf of bread uses 0.5 kg of flour and each batch of pastries uses 0.3 kg of flour. The total flour consumption must not exceed 60 kg available, giving $0.5b + 0.3p \leq 60$ . Choice B swaps the flour coefficients for bread and pastries. Choice C uses the baking time coefficients (0.2 and 0.4) instead of flour coefficients. Choice D uses the wrong inequality direction, suggesting the bakery must use at least 60 kg of flour rather than at most.
Let $c$ be the number of chocolate cakes and $v$ be the number of vanilla cakes. Which of the following is the correct objective function $P$ to be maximized?
Answer: $P = 15c + 12v$ The objective is to maximize profit. Profit is calculated as (Selling Price - Costs). For a chocolate cake, the profit is $25 - $10 = $15. For a vanilla cake, the profit is $20 - $8 = $12. Therefore, the total profit function $P$ to be maximized is $P = 15c + 12v$ . Distractor A represents the total revenue, not the profit. Distractor B represents the total cost, which should be minimized, not maximized. Distractor D incorrectly calculates profit by adding costs to the selling price instead of subtracting them.
If the objective is to minimize cost, and $p$ represents the number of PowerBars and $e$ represents the number of EnergyMax bars, which constraint is formulated incorrectly?
Answer: $300p + 250e \geq 1500$ (maximum calorie limitation) The correct answer is C. The calorie constraint should limit total calories to no more than 1500, so it should be $300p + 250e \leq 1500$ , not $\geq 1500$ . The ≥ symbol would require at least 1500 calories, contradicting the 'no more than 1500' requirement. Choice A correctly represents the minimum protein requirement (at least 100g). Choice B correctly represents the minimum carbohydrate requirement (at least 80g). Choice D correctly shows the standard non-negativity constraints.
Let $m$ be the kilograms of the meat product and $g$ be the kilograms of the grain product per bag. The company wants to minimize production cost. Which of the following constraints correctly represents the requirement for fat content in one bag of the mix?
Answer: $0.6 \le 0.1m + 0.05g \le 0.8$ The total amount of fat in the mix is the sum of the fat from each ingredient: $0.1$ kg of fat for every kg of meat product ( $m$ ) and $0.05$ kg of fat for every kg of grain product ( $g$ ). So, the total fat is $0.1m + 0.05g$ . The problem states the fat content must be 'between 0.6 kg and 0.8 kg, inclusive'. This means the total fat must be greater than or equal to 0.6 AND less than or equal to 0.8. This is correctly written as the double inequality $0.6 \le 0.1m + 0.05g \le 0.8$ . Distractor B only includes the minimum requirement for fat. Distractor C only includes the maximum requirement for fat. Distractor D incorrectly uses coefficients and combines variables in a way that does not represent the fat content.
Let $w$ be the acres of wheat and $b$ be the acres of barley. Which of the following systems correctly represents the constraints for maximizing profit?
Answer: $\begin{cases} w + b \le 200 \\ 3w + 2b \le 450 \\ b \ge 0.25w \\ w \ge 0, b \ge 0 \end{cases}$ When you encounter a linear programming problem like this, you need to translate each real-world constraint into mathematical inequalities. The key is carefully reading what each constraint actually says. Let's work through each constraint systematically. First, the farmer has 200 acres total, so $w + b \le 200$ . Second, with 450 hours of labor available and wheat requiring 3 hours per acre while barley requires 2 hours per acre, we get $3w + 2b \le 450$ . Third, since both crops require non-negative acreage, we need $w \ge 0, b \ge 0$ . The critical constraint is the soil health requirement: "the acreage devoted to barley must be at least 25% of the acreage devoted to wheat." This translates to $b \ge 0.25w$ , meaning barley acreage should be greater than or equal to one-quarter of wheat acreage. Choice B correctly captures all these constraints. Choice A reverses the soil health inequality to $w \ge 0.25b$ , which would mean wheat must be at least 25% of barley—the opposite of what's stated. Choice C uses $b \le 0.25w$ , making barley at most 25% of wheat, again contradicting the requirement. Choice D incorrectly uses the profit coefficients (150 and 120) in the land constraint instead of recognizing that land is measured in acres, not dollars. Study tip: In constraint problems, always double-check your inequality directions by plugging in simple numbers. If barley must be "at least 25%" of wheat, then when wheat = 100, barley should be able to equal 25 or more, confirming $b \ge 0.25w$ .
Let $s$ be the number of social media posts and $r$ be the number of radio ads. The goal is to maximize the total reach. Which of the following is the correct formulation of the problem's constraints?
Answer: $\begin{cases} 50s + 300r \le 12000 \\ r \ge 10 \\ s \ge 4r \\ s \ge 0, r \ge 0 \end{cases}$ This is a linear programming problem where you need to translate real-world constraints into mathematical inequalities. When setting up these problems, carefully match each constraint in the problem statement to its correct mathematical expression. The budget constraint uses costs, not reach numbers. Social media posts cost $50 each and radio ads cost $300 each, so the total cost is $50s + 300r$ , which cannot exceed the $12,000 budget: $50s + 300r \le 12000$ . The problem states "at least 10 radio ads," giving us $r \ge 10$ . For the synergistic effect, "social media posts must be at least four times the number of radio ads" means $s \ge 4r$ . Finally, you cannot have negative advertisements, so $s \ge 0, r \ge 0$ . Answer choice A incorrectly uses the reach values (2,000 and 9,000) in the budget constraint instead of the costs ($50 and $300). This is a common error when students confuse the objective function (what you're maximizing - total reach) with the constraint coefficients (costs). Answer choice C has the synergy constraint backwards, stating $r \ge 4s$ instead of $s \ge 4r$ . This would require radio ads to be at least four times the social media posts, opposite of what's stated. Answer choice D makes multiple errors: it uses $s + r \le 12000$ (ignoring actual costs) and incorrectly writes the synergy constraint as $s \le 4r$ . Study tip: In linear programming problems, always identify what each variable represents, then carefully translate each sentence into math. Double-check that you're using costs for budget constraints, not the values you're trying to maximize.
Let $a$ be the pounds of Arabica beans and $r$ be the pounds of Robusta beans used to create the blend. The company's goal is to minimize the cost of the beans used. Which of the following inequalities is NOT a valid constraint for this problem?
Answer: $a+r \ge 1$ Let's analyze the constraints. The company has 500 pounds of Arabica available, so $a \le 500$ . It has 400 pounds of Robusta, so $r \le 400$ . 'The weight of Robusta beans ( $r$ ) must be no more than ( $\le$ ) the weight of Arabica beans ( $a$ )', which is $r \le a$ . 'The blend must contain at least 30% Arabica beans by weight' means the amount of Arabica ( $a$ ) must be at least 30% of the total weight ( $a+r$ ), so $a \ge 0.30(a+r)$ . The constraints in A, B, and C are all valid. The constraint $a+r \ge 1$ suggests that the total blend must be at least 1 pound. While true in a practical sense to make even one bag, it is not a constraint given in the problem description; the problem is about the composition and availability of beans for a blend of any size. The core task is to determine the optimal ratio and total amount based on resource limits, not to meet a minimum production quota. Thus, this is not a specified constraint. Distractor A is a valid constraint on Arabica availability. Distractor B correctly models the flavor requirement. Distractor C correctly models the minimum percentage of Arabica.
A logistics company operates two types of delivery trucks: small trucks and large trucks. Small trucks can carry up to 3 tons and cost $200 per day to operate. Large trucks can carry up to 8 tons and cost $350 per day to operate. The company needs to deliver at least 50 tons of cargo daily and has a budget of $3000 per day for truck operations. Union agreements require that the number of small trucks used cannot be more than three times the number of large trucks used. If the goal is to minimize the total operating cost while meeting all constraints, which of the following represents the correct constraint for the cargo capacity requirement?
Answer: $3s + 8l \geq 50$ where $s$ = small trucks, $l$ = large trucks When you encounter a linear programming problem like this, you need to translate real-world constraints into mathematical inequalities. The key is carefully matching the given information to the correct mathematical expression. Let's identify what we know: small trucks carry 3 tons each, large trucks carry 8 tons each, and the company needs at least 50 tons delivered daily. Since we need "at least" 50 tons, we're looking for a "greater than or equal to" constraint (≥). The correct answer is D: $3s + 8l \geq 50$ . This properly represents that 3 tons per small truck times the number of small trucks, plus 8 tons per large truck times the number of large trucks, must equal or exceed 50 tons total. Choice A ( $200s + 350l \geq 50$ ) confuses capacity with cost. The values 200 and 350 represent daily operating costs, not cargo capacity, so this constraint would be meaningless for cargo requirements. Choice B ( $3s + 8l \leq 50$ ) has the wrong inequality direction. Using "less than or equal to" would mean the company wants to deliver at most 50 tons, which contradicts the requirement of delivering at least 50 tons. Choice C ( $8s + 3l \geq 50$ ) switches the capacity coefficients. This incorrectly assigns 8 tons capacity to small trucks and 3 tons to large trucks, which is backwards from the given information. Study tip: In linear programming problems, always double-check that your coefficients match the correct variables and that your inequality directions align with words like "at least" (≥) versus "at most" (≤).
Let $r$ be the number of Rockers and $g$ be the number of Gliders produced per week. Which of the following systems correctly formulates the constraints for this linear programming problem?
Answer: $\begin{cases} 2r + 4g \le 120 \\ 3r + 2g \le 100 \\ g \ge \frac{1}{3}r \\ r \ge 0, g \ge 0 \end{cases}$ Let $r$ be the number of Rockers and $g$ be the number of Gliders. The fabrication constraint is based on the 120 available hours: $2r + 4g \le 120$ . The finishing constraint is based on the 100 available hours: $3r + 2g \le 100$ . The marketing agreement states that the number of Gliders ( $g$ ) must be at least ( $\ge$ ) one-third of the number of Rockers ( $r$ ), which translates to $g \ge \frac{1}{3}r$ . Finally, the non-negativity constraints are $r \ge 0$ and $g \ge 0$ . This set of constraints matches option D. Distractor A incorrectly uses $\le$ for the marketing constraint. Distractor B mixes up the coefficients for $r$ and $g$ in the fabrication and finishing constraints. Distractor C incorrectly formulates the marketing constraint as $g \ge 3r$ , which would mean the number of gliders must be at least three times the number of rockers.
A pharmaceutical company produces two types of vitamin supplements: MultiVit and CalciumPlus. The production process requires three resources: ingredient A, ingredient B, and packaging material. Each bottle of MultiVit uses 2 units of ingredient A, 1 unit of ingredient B, and 1 unit of packaging. Each bottle of CalciumPlus uses 1 unit of ingredient A, 3 units of ingredient B, and 2 units of packaging. The company has 120 units of ingredient A, 150 units of ingredient B, and 100 units of packaging available daily. If the company must produce at least 20 bottles of MultiVit and the total production cannot exceed 80 bottles per day, what is the correct objective function to maximize profit given that MultiVit generates $8 profit per bottle and CalciumPlus generates $6 profit per bottle?
Answer: Maximize $P = 8x + 6y$ where $x$ = bottles of MultiVit, $y$ = bottles of CalciumPlus The correct answer is A. The objective is to maximize profit, so we need 'Maximize'. MultiVit generates $8 per bottle and CalciumPlus generates $6 per bottle. With $x$ = bottles of MultiVit and $y$ = bottles of CalciumPlus, the objective function is $P = 8x + 6y$ . Choice B swaps the profit coefficients. Choice C uses 'Minimize' instead of 'Maximize'. Choice D incorrectly defines the variables with $x$ as CalciumPlus and $y$ as MultiVit.
Let $n$ = tons of NitroBlend and $p$ = tons of PhosphoMax. Which constraint correctly represents the potassium requirement?
Answer: $0.15n + 0.30p \geq 6$ When you encounter linear programming problems involving mixtures or blends, you need to translate percentage compositions into constraint inequalities. The key is correctly converting percentages to decimals and setting up the "at least" requirement. For the potassium constraint, you need to calculate the total potassium contributed by both compounds. NitroBlend contains 15% potassium, which converts to 0.15 as a decimal. So $n$ tons of NitroBlend contributes $0.15n$ tons of potassium. PhosphoMax contains 30% potassium (0.30 as a decimal), so $p$ tons contributes $0.30p$ tons of potassium. Since the order requires "at least 6 tons" of potassium, the total must be greater than or equal to 6: $0.15n + 0.30p \geq 6$ . Choice A ( $15n + 30p \geq 6$ ) incorrectly uses the percentages as whole numbers instead of converting them to decimals. This would represent a constraint where you need only 6 units when the percentages are treated as 1500% and 3000% respectively. Choice B ( $0.30n + 0.15p \geq 6$ ) swaps the coefficients, incorrectly assigning NitroBlend's potassium percentage to PhosphoMax and vice versa. Choice D ( $0.15n + 0.30p \leq 6$ ) has the correct coefficients but uses "less than or equal to" instead of "greater than or equal to," which would limit potassium to a maximum of 6 tons rather than requiring at least 6 tons. Always convert percentages to decimals in constraint equations, and ensure your inequality direction matches the requirement ("at least" means ≥, "at most" means ≤).
Let $x$ be the number of grams of Ingredient X and $y$ be the number of grams of Ingredient Y in one dose. Which is the correct objective function $C$ to minimize, subject to the problem's constraints?
Answer: $C = 0.05x + 0.08y$ The problem asks to set up a linear programming problem to minimize the cost of one dose. The variables are defined as $x$ (grams of Ingredient X) and $y$ (grams of Ingredient Y). The cost of Ingredient X is $0.05 per gram, and the cost of Ingredient Y is $0.08 per gram. Therefore, the total cost $C$ of one dose is the sum of the costs of the ingredients used: $C = 0.05x + 0.08y$ . The objective is to minimize this function. Distractor A creates a function based on the Vitamin A content, which is a constraint, not the objective. Distractor B nonsensically combines the vitamin requirements with the vitamin contents into an objective function. Distractor D creates an objective function to minimize the total weight of the ingredients, not the cost.
If $C$ represents thousands of dollars invested in Conservative portfolios and $A$ represents thousands of dollars invested in Aggressive portfolios, which constraint is incorrectly formulated?
Answer: $C \geq 200$ (minimum Conservative investment requirement) The correct answer is B. Since $C$ represents thousands of dollars, the minimum $200,000 investment in Conservative portfolios should be written as $C \geq 200$ , not the value shown in choice B which would represent $200 thousand thousand = $200 million. All other constraints are correctly formulated: the budget constraint $C + A \leq 800$ properly uses thousands, $A \leq 2C$ correctly captures that Aggressive investments can't exceed twice Conservative investments, and $A \leq 400$ correctly represents the $400,000 limit in thousands.
Let $s$ be the amount invested in the stock fund and $b$ be the amount invested in the bond fund. The manager's goal is to maximize the expected return. Which of the following is the complete set of constraints for this allocation problem?
Answer: $\begin{cases} s + b \le 500000 \\ b \ge 100000 \\ s \le 2b \\ s \ge 0, b \ge 0 \end{cases}$ The total amount allocated cannot exceed $500,000, so $s + b \le 500000$ . 'At least $100,000 must be invested in the bond fund' translates to $b \ge 100000$ . 'The amount invested in the stock fund ( $s$ ) must not be more than ( $\le$ ) twice the amount invested in the bond fund ($2b$)' translates to $s \le 2b$ . Non-negativity constraints are $s \ge 0$ and $b \ge 0$ . This matches system A. Distractor B incorrectly assumes the entire $500,000 must be invested ($ s+b=500000$), which is not stated. Distractor C incorrectly reverses the variables in the risk-tolerance constraint, stating $b \le 2s$ . Distractor D reverses the inequalities for both the bond investment minimum and the risk-tolerance constraint.

Start this quiz