All practice questions

2195 questions

Question 2181Question

A freight logistics company operates delivery trucks on two distinct transit routes: Route Alpha and Route Beta.

- On Route Alpha, trucks travel at a constant speed of 6060 miles per hour and consume fuel at a rate of 88 gallons per hour.
- On Route Beta, trucks travel at a constant speed of 4545 miles per hour and consume fuel at a rate of 66 gallons per hour.

Yesterday, a fleet of trucks completed a total combined distance of 900900 miles across both routes in a combined total operating time of 1616 hours.

Based on this information, select the option that correctly identifies both the ratio of the distance traveled on Route Alpha to the distance traveled on Route Beta (Column 1) and the percentage of total fuel consumed that was used on Route Alpha (Column 2).

Show answer & explanation

Answer: Distance Ratio (Alpha : Beta) = 4 : 1; Fuel Percentage (Alpha) = 80%

Answer

Distance Ratio (Alpha : Beta) = 4 : 1; Fuel Percentage (Alpha) = 80%
Solving the system of simultaneous equations gives 12 hours on Route Alpha and 4 hours on Route Beta. Route Alpha accounts for 720 miles while Route Beta accounts for 180 miles, establishing a distance ratio of 720 : 180 = 4 : 1. Fuel consumption is 96 gallons on Route Alpha out of 120 total gallons consumed, which equals 80% of total fuel. The option matching Distance Ratio (Alpha : Beta) = 4 : 1 and Fuel Percentage (Alpha) = 80% is correct.

Step-by-Step Solution

1
Set up a system of linear equations for operating hours on each route
Let tAt_A be the time in hours spent on Route Alpha, and tBt_B be the time in hours spent on Route Beta.
1) Total time equation: tA+tB=16t_A + t_B = 16
2) Total distance equation: 60tA+45tB=90060 t_A + 45 t_B = 900
Distance equals speed multiplied by time for each route.
2
Solve for tAt_A and tBt_B
Substitute tB=16tAt_B = 16 - t_A into the distance equation:
60tA+45(16tA)=90060 t_A + 45(16 - t_A) = 900
60tA+72045tA=90060 t_A + 720 - 45 t_A = 900
15tA=180    tA=1215 t_A = 180 \implies t_A = 12 hours.
Then tB=1612=4t_B = 16 - 12 = 4 hours.
Isolating the single variable tAt_A provides the exact time spent on each route.
3
Calculate distances and determine the distance ratio (Column 1)
Distance on Route Alpha (DAD_A) = 60 mph×12 hours=72060 \text{ mph} \times 12 \text{ hours} = 720 miles.
Distance on Route Beta (DBD_B) = 45 mph×4 hours=18045 \text{ mph} \times 4 \text{ hours} = 180 miles.
Ratio DA:DB=720:180=4:1D_A : D_B = 720 : 180 = 4 : 1.
Computing individual route distances yields the distance ratio required for Column 1.
4
Calculate total fuel consumption and the percentage spent on Route Alpha (Column 2)
Fuel on Route Alpha (FAF_A) = 12 hours×8 gal/hr=9612 \text{ hours} \times 8 \text{ gal/hr} = 96 gallons.
Fuel on Route Beta (FBF_B) = 4 hours×6 gal/hr=244 \text{ hours} \times 6 \text{ gal/hr} = 24 gallons.
Total fuel (FtotalF_{\text{total}}) = 96+24=12096 + 24 = 120 gallons.
Percentage on Route Alpha = 96120×100%=80%\frac{96}{120} \times 100\% = 80\%.
Multiplying time by consumption rate gives fuel volume, from which the relative percentage is calculated.

Key Concept

Simultaneous Rate and System Constraint Modeling
Question 2182Question

A pharmaceutical laboratory uses two automated centrifuge units, Unit Alpha and Unit Beta, to process liquid compound solutions into a central storage tank.

- Unit Alpha processes a solution containing 15%15\% active compound at a constant rate of 4040 liters per hour.
- Unit Beta processes a solution containing 35%35\% active compound at a constant rate of 6060 liters per hour.

If both units operate simultaneously for 55 hours, what is the percentage of active compound in the total combined solution collected in the tank?

Show answer & explanation

Answer: 27

Answer

The active compound concentration in the combined solution is 27%27\%.
The correct answer of 27%27\% is obtained by determining the overall mass balance: Unit Alpha contributes 3030 liters of active compound from 200200 liters of total liquid, while Unit Beta contributes 105105 liters of active compound from 300300 liters of total liquid. Dividing the total active compound (135135 liters) by the total liquid (500500 liters) gives 0.270.27, or 27%27\%.

Step-by-Step Solution

1
Determine the total volume and active compound volume produced by Unit Alpha.
Unit Alpha produces 200200 liters of total liquid (40×540 \times 5) containing 3030 liters of active compound (200×0.15200 \times 0.15).
Volume equals rate multiplied by time, and active compound volume equals total volume multiplied by its concentration percentage.
2
Determine the total volume and active compound volume produced by Unit Beta.
Unit Beta produces 300300 liters of total liquid (60×560 \times 5) containing 105105 liters of active compound (300×0.35300 \times 0.35).
Applied the same volume and percentage relationship to Unit Beta.
3
Compute the combined total volume and total active compound volume.
Total combined liquid volume = 200+300=500200 + 300 = 500 liters. Total active compound = 30+105=13530 + 105 = 135 liters.
Combining the output of both units sums their respective liquid and active compound volumes.
4
Calculate the combined percentage concentration.
135500×100%=27%.\frac{135}{500} \times 100\% = 27\%.
The final concentration is the ratio of total active compound to total liquid volume expressed as a percentage.

Key Concept

Weighted Average Percentage Concentration
Question 2183Question

A museum conservation board classifies historical artifacts into three management streams based on two parameters: Material Sensitivity (High or Moderate) and Structural Fragility Index (a numerical score from 11 to 100100). The classification rules are defined as follows:

- Track Y (Long-Term Preservation): Assigned if an artifact has High Material Sensitivity AND a Structural Fragility Index score of at least 7070.
- Track X (Immediate Stabilization): Assigned if an artifact meets EXACTLY ONE of the two conditions (either High Material Sensitivity OR a Structural Fragility Index score of at least 7070, but not both).
- Routine Storage: Assigned if an artifact meets NEITHER condition (Moderate Material Sensitivity AND a Structural Fragility Index score below 7070).

Match each of the following three artifacts to its correct management stream.

Click a left item, then click its matching right item

Items

Artifact Alpha: High Material Sensitivity; Structural Fragility Index of 75
Artifact Beta: Moderate Material Sensitivity; Structural Fragility Index of 82
Artifact Gamma: Moderate Material Sensitivity; Structural Fragility Index of 50

Matches

Show answer & explanation

Answer

Artifact Alpha matches with Track Y (Long-Term Preservation); Artifact Beta matches with Track X (Immediate Stabilization); Artifact Gamma matches with Routine Storage.
Artifact Alpha satisfies both criteria (High Sensitivity and Fragility Index 70\ge 70), placing it in Track Y. Artifact Beta satisfies only the Fragility Index criterion (70\ge 70), placing it in Track X. Artifact Gamma satisfies neither criterion, placing it in Routine Storage.

Step-by-Step Solution

1
Evaluate Artifact Alpha against the classification rules.
Material Sensitivity is High (True) and Fragility Index is 757075 \ge 70 (True).
Both conditions are satisfied simultaneously, which matches the criteria for Track Y (Long-Term Preservation).
2
Evaluate Artifact Beta against the classification rules.
Material Sensitivity is Moderate (False) and Fragility Index is 827082 \ge 70 (True).
Exactly one condition is satisfied, which matches the criteria for Track X (Immediate Stabilization).
3
Evaluate Artifact Gamma against the classification rules.
Material Sensitivity is Moderate (False) and Fragility Index is 50<7050 < 70 (False).
Neither condition is satisfied, which matches the criteria for Routine Storage.

Key Concept

Categorical classification using multi-attribute boolean logical operators (AND, XOR, NOR).
Question 2184Question

A central logistics facility classifies incoming freight shipments into four priority processing queues—Queue 1 (Highest Priority), Queue 2, Queue 3, and Queue 4 (Lowest Priority)—based on two parameters: Hazard Level (High, Medium, Low) and Perishability Index (1 to 5, where 5 indicates maximum perishability).

The classification rules are as follows:
- Queue 1: Any shipment with a High Hazard Level, OR a Perishability Index of 4 or 5.
- Queue 2: Any shipment NOT in Queue 1 that has a Medium Hazard Level AND a Perishability Index of 3.
- Queue 3: Any shipment NOT in Queue 1 or 2 that has a Low Hazard Level with a Perishability Index of 3, OR a Medium Hazard Level with a Perishability Index less than 3.
- Queue 4: Any shipment NOT in Queue 1, 2, or 3 that has a Low Hazard Level with a Perishability Index of 1 or 2.

Four shipments are evaluated:
- Shipment Alpha: Low Hazard Level, Perishability Index of 5
- Shipment Beta: Medium Hazard Level, Perishability Index of 3
- Shipment Gamma: Medium Hazard Level, Perishability Index of 2
- Shipment Delta: Low Hazard Level, Perishability Index of 1

Based on the classification rules, in what sequence should these four shipments be arranged from highest priority queue (Queue 1) to lowest priority queue (Queue 4)?

Drag items to arrange them in the correct order

Show answer & explanation

Answer

The correct sequence from highest to lowest priority is Shipment Alpha (Queue 1), Shipment Beta (Queue 2), Shipment Gamma (Queue 3), and Shipment Delta (Queue 4).
Evaluating each shipment according to the rules places Shipment Alpha in Queue 1 (highest priority due to Perishability Index 5), Shipment Beta in Queue 2 (Medium Hazard and Perishability Index 3), Shipment Gamma in Queue 3 (Medium Hazard and Perishability Index 2), and Shipment Delta in Queue 4 (Low Hazard and Perishability Index 1). Thus, the correct priority order is Shipment Alpha, Shipment Beta, Shipment Gamma, Shipment Delta.

Step-by-Step Solution

1
Evaluate Shipment Alpha against the priority queue rules.
Shipment Alpha has Low Hazard Level and Perishability Index 5. Since Perishability Index is 5, it satisfies Queue 1.
Queue 1 includes any shipment with a High Hazard Level or a Perishability Index of 4 or 5.
2
Evaluate Shipment Beta against the priority queue rules.
Shipment Beta has Medium Hazard Level and Perishability Index 3. It does not meet Queue 1 criteria, but meets Queue 2 criteria.
Queue 2 specifies Medium Hazard Level and Perishability Index of 3.
3
Evaluate Shipment Gamma against the priority queue rules.
Shipment Gamma has Medium Hazard Level and Perishability Index 2. It falls under Queue 3.
Queue 3 includes Medium Hazard Level shipments with a Perishability Index less than 3.
4
Evaluate Shipment Delta against the priority queue rules.
Shipment Delta has Low Hazard Level and Perishability Index 1. It falls under Queue 4.
Queue 4 specifies Low Hazard Level with a Perishability Index of 1 or 2.

Key Concept

Categorical Classification and Multi-Attribute Priority Sorting
Question 2185Question

A regional logistics operator manages cargo transit on a river corridor using two types of vessels: Express Barges (EE) and Heavy-Haul Barges (HH). Weekly operational constraints are defined as follows:

- Fuel Allowance: Each Express Barge consumes 88 metric tons of fuel per trip, and each Heavy-Haul Barge consumes 1212 metric tons. Total weekly fuel consumption cannot exceed 144144 metric tons.
- Crew Availability: Each Express Barge requires 33 crew shifts, and each Heavy-Haul Barge requires 22 crew shifts. Total available crew shifts per week cannot exceed 3030.
- Service Minimum: The operator must deploy at least 22 Heavy-Haul Barges (H2H \ge 2) per week to maintain baseline commercial obligations.
- Profit Structure: Each Express Barge generates a net profit of $5,000\$5,000, and each Heavy-Haul Barge generates a net profit of $6,000\$6,000.

Match each operational metric on the left with its correct optimal value under the profit-maximizing schedule of integer barge deployments.

Click a left item, then click its matching right item

Items

Number of Express Barges (EE) in the profit-maximizing schedule
Number of Heavy-Haul Barges (HH) in the profit-maximizing schedule
Maximum total weekly profit achieved (in thousands of dollars)

Matches

Show answer & explanation

Answer

The profit-maximizing deployment requires 33 Express Barges and 1010 Heavy-Haul Barges, yielding a total maximum profit of 7575 thousand dollars ($75,000\$75,000).
The correct matches establish that deploying 33 Express Barges and 1010 Heavy-Haul Barges yields the maximum possible weekly profit of $75,000\$75,000. This combination uses 2(3)+3(10)=362(3) + 3(10) = 36 tons of fuel (using 100%100\% of fuel capacity) and 3(3)+2(10)=293(3) + 2(10) = 29 crew shifts (out of 3030 available), satisfying all joint constraints.

Step-by-Step Solution

1
Formulate the linear programming inequalities from the narrative constraints.
Fuel constraint: 8E+12H144    2E+3H368E + 12H \le 144 \implies 2E + 3H \le 36.
Crew constraint: 3E+2H303E + 2H \le 30.
Bounds: H2H \ge 2, E0E \ge 0, with E,HZE, H \in \mathbb{Z}.
Profit function: P(E,H)=5E+6HP(E, H) = 5E + 6H (in thousands of dollars).
Converting real-world bounds into simplified algebraic inequalities is required to determine the feasible integer region.
2
Identify boundary integer candidate points near the intersection of the constraints.
Solving 2E+3H=362E + 3H = 36 and 3E+2H=303E + 2H = 30 gives 5H=48    H=9.6,E=3.65H = 48 \implies H = 9.6, E = 3.6.
Testing adjacent integer points (E,H)(E, H) within the feasible region:
- Case 1: H=10    2E+3036    E3H = 10 \implies 2E + 30 \le 36 \implies E \le 3. Check crew for (3,10)(3, 10): 3(3)+2(10)=29303(3) + 2(10) = 29 \le 30 (Feasible). Profit P=5(3)+6(10)=75P = 5(3) + 6(10) = 75.
- Case 2: H=9    2E+2736    E4H = 9 \implies 2E + 27 \le 36 \implies E \le 4. Check crew for (4,9)(4, 9): 3(4)+2(9)=30303(4) + 2(9) = 30 \le 30 (Feasible). Profit P=5(4)+6(9)=74P = 5(4) + 6(9) = 74.
- Case 3: H=12    2E+3636    E=0H = 12 \implies 2E + 36 \le 36 \implies E = 0. Check crew for (0,12)(0, 12): 3(0)+2(12)=24303(0) + 2(12) = 24 \le 30 (Feasible). Profit P=6(12)=72P = 6(12) = 72.
- Case 4: H=11    2E+3336    E1H = 11 \implies 2E + 33 \le 36 \implies E \le 1. Check crew for (1,11)(1, 11): 3(1)+2(11)=25303(1) + 2(11) = 25 \le 30 (Feasible). Profit P=5(1)+6(11)=71P = 5(1) + 6(11) = 71.
Since integer constraints apply, evaluating feasible grid points along the constraint boundary identifies the global maximum.
3
Compare profit outcomes and confirm optimal values.
The maximum profit occurs at (E,H)=(3,10)(E, H) = (3, 10), giving a profit of $75,000\$75,000.
Comparing all candidate integer points verifies that E=3E=3, H=10H=10, and P=75P=75 is the unique optimal solution.

Key Concept

Integer Optimization under Simultaneous Bounded Constraints
Question 2186Question

A venture capital firm classifies its portfolio companies into four strategic management categories based on two quarterly performance metrics: Burn Multiple (BB) and Customer Retention Rate (RR).

Classification Criteria:
- Category 1 (Prime Growth): B1.5B \le 1.5 and R85%R \ge 85\%
- Category 2 (Capital Efficient): B1.5B \le 1.5 and R<85%R < 85\%
- Category 3 (Expansion Focused): B>1.5B > 1.5 and R85%R \ge 85\%
- Category 4 (High Risk): B>1.5B > 1.5 and R<85%R < 85\%

Match each portfolio company to its corresponding strategic management category.

Click a left item, then click its matching right item

Items

Company P: B=1.2B = 1.2, R=90%R = 90\%
Company Q: B=1.4B = 1.4, R=80%R = 80\%
Company R: B=1.8B = 1.8, R=88%R = 88\%
Company S: B=2.1B = 2.1, R=75%R = 75\%

Matches

Show answer & explanation

Answer

Company P matches Category 1 (Prime Growth); Company Q matches Category 2 (Capital Efficient); Company R matches Category 3 (Expansion Focused); Company S matches Category 4 (High Risk).
Each company is mapped to its category by evaluating its two metrics against the threshold boundary conditions (B=1.5B = 1.5 and R=85%R = 85\%). Company P satisfies low burn (B1.5B \le 1.5) and high retention (R85%R \ge 85\%), placing it in Category 1. Company Q meets low burn but has lower retention (R<85%R < 85\%), placing it in Category 2. Company R exceeds the burn threshold (B>1.5B > 1.5) but maintains high retention (R85%R \ge 85\%), placing it in Category 3. Company S exceeds the burn threshold and has lower retention, placing it in Category 4.

Step-by-Step Solution

1
Evaluate Company P (B=1.2,R=90%B = 1.2, R = 90\%) against threshold rules.
B=1.21.5B = 1.2 \le 1.5 is true, and R=90%85%R = 90\% \ge 85\% is true. This satisfies Category 1 (Prime Growth).
Both metric conditions match the exact criteria for Category 1.
2
Evaluate Company Q (B=1.4,R=80%B = 1.4, R = 80\%) against threshold rules.
B=1.41.5B = 1.4 \le 1.5 is true, but R=80%<85%R = 80\% < 85\% is true. This satisfies Category 2 (Capital Efficient).
Low burn multiple combined with retention rate below 85%85\% places the entity in Category 2.
3
Evaluate Company R (B=1.8,R=88%B = 1.8, R = 88\%) against threshold rules.
B=1.8>1.5B = 1.8 > 1.5 is true, and R=88%85%R = 88\% \ge 85\% is true. This satisfies Category 3 (Expansion Focused).
Burn multiple exceeding 1.51.5 combined with high retention places the entity in Category 3.
4
Evaluate Company S (B=2.1,R=75%B = 2.1, R = 75\%) against threshold rules.
B=2.1>1.5B = 2.1 > 1.5 is true, and R=75%<85%R = 75\% < 85\% is true. This satisfies Category 4 (High Risk).
Both metrics fail the favorable thresholds, placing the entity in Category 4.

Key Concept

Categorical Classification and Sorting
Question 2187Question

A cloud analytics company configures daily data processing operations using two types of virtual server instances: Compute-Optimized (CC) and Memory-Optimized (MM). The operational parameters and constraints are as follows:

- Each CC instance processes 50 batch jobs per hour and incurs an operating cost of 15perhour.Each15 per hour. - Each M instanceprocesses30batchjobsperhourandincursanoperatingcostof instance processes 30 batch jobs per hour and incurs an operating cost of 10 per hour.
- The system must process at least 360 batch jobs per hour in total.
- The total hourly operating budget for server instances cannot exceed 115.Duetoactivedatabasecachingpolicies,atleast3115. - Due to active database caching policies, at least 3 M instancesmustbeactiveatalltimes( instances must be active at all times ( M \ge 3 ).). - C and and M$ must both be non-negative integers.

Which of the following combinations of Compute (CC) and Memory (MM) server instances maximizes the total hourly job throughput while satisfying all operational constraints?

Show answer & explanation

Answer: 5 Compute instances and 4 Memory instances

Answer

5 Compute instances and 4 Memory instances
The combination of 5 Compute instances and 4 Memory instances satisfies all stated system bounds (15×5+10×4=11511515 \times 5 + 10 \times 4 = 115 \le 115, 50×5+30×4=37036050 \times 5 + 30 \times 4 = 370 \ge 360, and 434 \ge 3) and delivers the maximum feasible throughput of 370 jobs per hour.

Step-by-Step Solution

1
Formulate the linear system of inequalities from the given constraints.
Throughput: 50C+30M3605C+3M3650C + 30M \ge 360 \Rightarrow 5C + 3M \ge 36.
Budget: 15C+10M1153C+2M2315C + 10M \le 115 \Rightarrow 3C + 2M \le 23.
Minimum MM: M3M \ge 3, where C,MZ0C, M \in \mathbb{Z}_{\ge 0}.
Converting narrative conditions into simplified algebraic inequalities makes constraint checking straightforward.
2
Determine the set of integer pairs (C,M)(C, M) that satisfy all three inequalities.
Combining 3C+2M233C + 2M \le 23 and 5C+3M365C + 3M \ge 36 with M3M \ge 3 yields only two valid integer pairs:
- Pair 1: (C=3,M=7)(C=3, M=7) with cost 15(3)+10(7)=11515(3)+10(7)=115 and throughput 50(3)+30(7)=36050(3)+30(7)=360
- Pair 2: (C=5,M=4)(C=5, M=4) with cost 15(5)+10(4)=11515(5)+10(4)=115 and throughput 50(5)+30(4)=37050(5)+30(4)=370
Systematic testing of integer values bounded by the linear inequalities identifies all feasible solutions.
3
Compare total throughput across feasible solutions to find the maximum.
Pair 2 (C=5,M=4)(C=5, M=4) produces 370 jobs per hour, which exceeds Pair 1's 360 jobs per hour.
The question specifically asks to maximize throughput among all valid configurations.

Key Concept

Optimization under linear integer constraints and bounded systems
Question 2188Question

A metropolitan transit authority categorizes electric buses into three maintenance tiers based on two performance metrics: Cumulative Mileage (in thousands of kilometers) and Battery State of Health (SoH) (as a percentage).

The classification policy dictates:
- Tier I (Standard Operation): Cumulative Mileage 200\le 200 thousand km AND Battery SoH 85%\ge 85\%.
- Tier II (Battery Refurbishment): Cumulative Mileage 300\le 300 thousand km with Battery SoH between 70%70\% and 84%84\% (inclusive); OR Cumulative Mileage between 201201 and 300300 thousand km (inclusive) with Battery SoH 85%\ge 85\%.
- Tier III (Fleet Retirement): Cumulative Mileage >300> 300 thousand km OR Battery SoH <70%< 70\% regardless of mileage.

Two buses in the fleet present the following data:
- Bus X: Cumulative Mileage = 160160 thousand km; Battery SoH = 90%90\%
- Bus Y: Cumulative Mileage = 180180 thousand km; Battery SoH = 82%82\%

Based on the classification policy, which of the following correctly pairs Bus X and Bus Y with their respective maintenance tiers?

Show answer & explanation

Answer: Bus X is assigned to Tier I, and Bus Y is assigned to Tier II.

Answer

Bus X is assigned to Tier I, and Bus Y is assigned to Tier II.
Evaluating Bus X: Mileage of 160 thousand km is ≤ 200 and Battery SoH of 90% is ≥ 85%, satisfying both criteria for Tier I. Evaluating Bus Y: Mileage of 180 thousand km is ≤ 300 and Battery SoH of 82% is between 70% and 84%, satisfying Tier II. Thus, Bus X is assigned to Tier I and Bus Y to Tier II.

Step-by-Step Solution

1
Evaluate Bus X against the classification rules
Bus X has Cumulative Mileage = 160 thousand km (≤ 200) and Battery SoH = 90% (≥ 85%). Both conditions for Tier I (Standard Operation) are met.
Tier I requires both mileage ≤ 200 thousand km and SoH ≥ 85%.
2
Evaluate Bus Y against the classification rules
Bus Y has Cumulative Mileage = 180 thousand km (≤ 300) and Battery SoH = 82% (between 70% and 84%). This fits the first clause of Tier II (Battery Refurbishment).
Although Bus Y's mileage is under 200 thousand km, its SoH of 82% falls below the Tier I requirement of 85% but fits within the 70%–84% range specified for Tier II.
3
Combine the evaluations to select the correct paired response
Bus X belongs to Tier I and Bus Y belongs to Tier II.
Both individual classifications match this paired statement.

Key Concept

Multi-attribute categorical classification based on compound conditional logic
Estimated Time:1m 30s
Question 2189Question

A municipal transit agency is installing two types of electric vehicle (EV) charging stations at a new central station: Level 2 Chargers (LL) and Level 3 Fast Chargers (DD). Each Level 2 charger costs $4,000\$4,000 to install and draws 10 kW10\text{ kW} of grid power. Each Level 3 charger costs $15,000\$15,000 to install and draws 50 kW50\text{ kW} of grid power. The agency has a total installation budget of $100,000\$100,000 and a maximum available grid power allocation of 320 kW320\text{ kW}. To meet minimum service grant requirements, the hub must install at least 5 Level 2 chargers (L5L \ge 5) and at least 3 Level 3 chargers (D3D \ge 3). Each Level 2 charger can serve up to 8 sessions per day, and each Level 3 charger can serve up to 30 sessions per day. Match each operational optimization metric on the left with its corresponding correct value on the right that maximizes the total daily charging sessions served by the hub.

Click a left item, then click its matching right item

Items

Optimal number of Level 2 chargers (LL)
Optimal number of Level 3 chargers (DD)
Maximum total daily charging sessions

Matches

Show answer & explanation

Answer

The optimal operational configuration consists of 10 Level 2 chargers and 4 Level 3 chargers, achieving a maximum total of 200 daily charging sessions.
To maximize daily sessions S=8L+30DS = 8L + 30D under budget 4L+15D1004L + 15D \le 100, power L+5D32L + 5D \le 32, and lower bounds L5,D3L \ge 5, D \ge 3, testing valid integer points shows that setting Level 3 chargers to 4 and Level 2 chargers to 10 satisfies all joint constraints while achieving the peak capacity of 200 total daily sessions.

Step-by-Step Solution

1
Formulate the linear system of constraints and objective function.
Budget constraint: 4,000L+15,000D100,000    4L+15D1004,000L + 15,000D \le 100,000 \implies 4L + 15D \le 100.
Power constraint: 10L+50D320    L+5D3210L + 50D \le 320 \implies L + 5D \le 32.
Minimum bounds: L5L \ge 5 and D3D \ge 3.
Objective function to maximize: S=8L+30DS = 8L + 30D.
Define the mathematical boundaries and optimization goal based on problem parameters.
2
Evaluate feasible integer values for Level 3 chargers (DD).
Case 1: If D=3D = 3:
- Budget bound: 4L+15(3)100    4L55    L134L + 15(3) \le 100 \implies 4L \le 55 \implies L \le 13.
- Power bound: L+5(3)32    L17L + 5(3) \le 32 \implies L \le 17.
- Max feasible L=13L = 13.
- Total sessions S=8(13)+30(3)=104+90=194S = 8(13) + 30(3) = 104 + 90 = 194.

Case 2: If D=4D = 4:
- Budget bound: 4L+15(4)100    4L40    L104L + 15(4) \le 100 \implies 4L \le 40 \implies L \le 10.
- Power bound: L+5(4)32    L12L + 5(4) \le 32 \implies L \le 12.
- Max feasible L=10L = 10.
- Total sessions S=8(10)+30(4)=80+120=200S = 8(10) + 30(4) = 80 + 120 = 200.

Case 3: If D=5D = 5:
- Budget bound: 4L+15(5)100    4L25    L64L + 15(5) \le 100 \implies 4L \le 25 \implies L \le 6.
- Power bound: L+5(5)32    L7L + 5(5) \le 32 \implies L \le 7.
- Max feasible L=6L = 6.
- Total sessions S=8(6)+30(5)=48+150=198S = 8(6) + 30(5) = 48 + 150 = 198.

Case 4: If D=6D = 6:
- Budget bound: 4L+15(6)100    4L10    L24L + 15(6) \le 100 \implies 4L \le 10 \implies L \le 2.
- Violates minimum constraint L5L \ge 5.
Systematically check integer combinations of variables within the feasible region to identify maximum daily sessions.
3
Compare total sessions across valid integer pairs.
The maximum session count occurs when D=4D = 4 and L=10L = 10, producing S=200S = 200 daily sessions.
Determine the unique optimal combination satisfying all joint constraints.

Key Concept

Linear Optimization under Bounded Integer Constraints
Estimated Time:2m 0s
Question 2190Question

A boutique catering kitchen prepares custom corporate event packages containing two types of dessert selections: Specialty Layer Cakes (LL) and Miniature Cupcake Sets (MM). Each Specialty Layer Cake requires 33 hours of decorating labor and 44 kg of specialized flour. Each Miniature Cupcake Set requires 11 hour of decorating labor and 22 kg of specialized flour. For an upcoming event order, the kitchen has a maximum resource availability of 3030 total hours of decorating labor and 4444 kg of specialized flour. To meet client specifications, the kitchen must produce at least 44 Specialty Layer Cakes. If each Specialty Layer Cake yields a profit of $50\$50 and each Miniature Cupcake Set yields a profit of $20\$20, which of the following pairs of (L,M)(L, M) represents the combination of Specialty Layer Cakes and Miniature Cupcake Sets that maximizes total profit while satisfying all resource constraints?

Show answer & explanation

Answer: (8,6)(8, 6)

Answer

The optimal production combination is 8 Specialty Layer Cakes and 6 Miniature Cupcake Sets, yielding a maximum profit of $520.
The pair (8,6)(8, 6) satisfies the minimum requirement of at least 4 Specialty Layer Cakes (848 \ge 4), requires 3(8)+1(6)=303(8) + 1(6) = 30 labor hours (within the 30-hour limit), and requires 4(8)+2(6)=444(8) + 2(6) = 44 kg of flour (within the 44-kg limit). It yields a total profit of 50(8)+20(6)=$52050(8) + 20(6) = \$520, which is the highest achievable profit among all feasible combinations.

Step-by-Step Solution

1
Formulate the mathematical model for constraints and objective function.
Decorating Labor: 3L+M303L + M \le 30; Specialized Flour: 4L+2M444L + 2M \le 44 (or 2L+M222L + M \le 22); Minimum Requirement: L4L \ge 4; Profit: P=50L+20MP = 50L + 20M.
Establishing explicit linear inequality bounds allows systematic evaluation of feasible integer pairs (L,M)(L, M).
2
Determine upper bound for MM as a function of integer values of L4L \ge 4.
For L=4L=4: Mmin(3012,228)=14    P=50(4)+20(14)=$480M \le \min(30-12, 22-8) = 14 \implies P = 50(4)+20(14) = \$480.
For L=5L=5: Mmin(3015,2210)=12    P=50(5)+20(12)=$490M \le \min(30-15, 22-10) = 12 \implies P = 50(5)+20(12) = \$490.
For L=6L=6: Mmin(3018,2212)=10    P=50(6)+20(10)=$500M \le \min(30-18, 22-12) = 10 \implies P = 50(6)+20(10) = \$500.
For L=7L=7: Mmin(3021,2214)=8    P=50(7)+20(8)=$510M \le \min(30-21, 22-14) = 8 \implies P = 50(7)+20(8) = \$510.
For L=8L=8: Mmin(3024,2216)=6    P=50(8)+20(6)=$520M \le \min(30-24, 22-16) = 6 \implies P = 50(8)+20(6) = \$520.
For L=9L=9: Mmin(3027,2218)=3    P=50(9)+20(3)=$510M \le \min(30-27, 22-18) = 3 \implies P = 50(9)+20(3) = \$510.
For L=10L=10: Mmin(3030,2220)=0    P=50(10)+20(0)=$500M \le \min(30-30, 22-20) = 0 \implies P = 50(10)+20(0) = \$500.
Evaluating potential corner points and boundary integer points identifies the maximum profit within the bounded region.
3
Compare maximum calculated profit across all valid integer pairs.
The highest profit occurs at L=8,M=6L = 8, M = 6 with P=$520P = \$520.
This point satisfies all constraints while maximizing the objective function.

Key Concept

Optimization under multiple joint inequality constraints
Question 2191Question

A printing company produces two types of customized marketing materials: Standard brochures (SS) and Premium brochures (PP). Each Standard brochure requires 22 minutes of printing time and 11 minute of binding time. Each Premium brochure requires 33 minutes of printing time and 33 minutes of binding time. The production facility has a maximum daily capacity of 240240 minutes for printing and 180180 minutes for binding. Due to a recurring client agreement, the facility must produce at least 2020 Standard brochures per day. The profit is $4\$4 per Standard brochure and $9\$9 per Premium brochure. Match each optimization variable or outcome on the left with its correct value on the right that maximizes daily total profit while satisfying all operational constraints.

Click a left item, then click its matching right item

Items

Optimal number of Standard brochures (SS)
Optimal number of Premium brochures (PP)
Maximum total daily profit (ZZ)

Matches

Show answer & explanation

Answer

The optimal production values are 6060 Standard brochures and 4040 Premium brochures, resulting in a maximum daily profit of $600\$600.
Solving the system of simultaneous constraints yields the optimal vertex at S=60S = 60 Standard brochures and P=40P = 40 Premium brochures. At this point, both printing (2(60)+3(40)=2402(60) + 3(40) = 240) and binding (60+3(40)=18060 + 3(40) = 180) capacities are fully utilized, achieving the maximum daily profit of 4(60)+9(40)=$6004(60) + 9(40) = \$600.

Step-by-Step Solution

1
Formulate the linear programming model with constraints and objective function.
Constraints: 2S+3P2402S + 3P \le 240 (printing time), S+3P180S + 3P \le 180 (binding time), S20S \ge 20 (contractual minimum), and S,P0S, P \ge 0. Objective: Maximize Z=4S+9PZ = 4S + 9P.
Clear mathematical formulation is required to define the feasible region bounded by resource limits.
2
Calculate the intersection points (vertices) of the boundary lines of the feasible region.
Subtracting S+3P=180S + 3P = 180 from 2S+3P=2402S + 3P = 240 yields S=60S = 60. Substituting S=60S = 60 into S+3P=180S + 3P = 180 gives 3P=120    P=403P = 120 \implies P = 40. Corner point 1: (60,40)(60, 40).
The fundamental theorem of linear programming states that maximum profit occurs at a vertex of the feasible region.
3
Find remaining boundary vertices satisfying all constraints.
Corner point 2: (120,0)(120, 0) from printing limit when P=0P=0 (satisfies binding limit 120180120 \le 180). Corner point 3: (20,53)(20, 53) when S=20S=20 (integer constraint on PP where 20+3P180    P53.3320 + 3P \le 180 \implies P \le 53.33). Corner point 4: (20,0)(20, 0).
All feasible vertices must be identified to compare their objective function values.
4
Evaluate the profit function Z=4S+9PZ = 4S + 9P at each vertex point.
At (60,40)(60, 40): Z=4(60)+9(40)=240+360=$600Z = 4(60) + 9(40) = 240 + 360 = \$600. At (120,0)(120, 0): Z=4(120)=$480Z = 4(120) = \$480. At (20,53)(20, 53): Z=4(20)+9(53)=80+477=$557Z = 4(20) + 9(53) = 80 + 477 = \$557. At (20,0)(20, 0): Z=4(20)=$80Z = 4(20) = \$80.
Direct substitution reveals which corner point yields the global maximum value inside the bounded constraints.

Key Concept

Linear programming optimization under joint resource and integer bound constraints
Question 2192Question

A high-tech manufacturing firm produces custom drone components: Micro-Sensors (SS) and Control Units (UU). Each Micro-Sensor requires 2 hours of precision calibration and 1 GB of firmware memory allocation. Each Control Unit requires 5 hours of precision calibration and 4 GB of firmware memory allocation. For an upcoming production batch, the facility has a maximum of 40 hours of calibration time available and a maximum total memory allocation limit of 30 GB. If the firm earns a profit of 100perMicroSensorand100 per Micro-Sensor and 350 per Control Unit, which of the following combinations of Micro-Sensors (SS) and Control Units (UU) maximizes total batch profit while satisfying all operational bounds?

Show answer & explanation

Answer: 2 Micro-Sensors and 7 Control Units

Answer

The combination of 2 Micro-Sensors and 7 Control Units maximizes total profit ($2,650) under the given calibration and memory constraints.
The pair with 2 Micro-Sensors and 7 Control Units fully satisfies both constraints (2(2)+5(7)=39leq402(2) + 5(7) = 39 \\leq 40 hours and 2+4(7)=30leq302 + 4(7) = 30 \\leq 30 GB) and yields the maximum profit of $2,650.

Step-by-Step Solution

1
Set up the linear programming model with objective function and system of inequalities.
Maximize P=100S+350UP = 100S + 350U subject to: 2S+5Uleq402S + 5U \\leq 40 (Calibration limit), S+4Uleq30S + 4U \\leq 30 (Memory limit), and non-negative integers S,Ugeq0S, U \\geq 0.
Establishing explicit bounds is necessary to evaluate boundary integer points.
2
Solve for the intersection of the boundary equations 2S+5U=402S + 5U = 40 and S+4U=30S + 4U = 30.
Substituting S=304US = 30 - 4U into the first equation yields 2(304U)+5U=40implies603U=40impliesU=20/3approx6.672(30 - 4U) + 5U = 40 \\implies 60 - 3U = 40 \\implies U = 20/3 \\approx 6.67 and S=3.33S = 3.33.
The continuous optimal point occurs at the intersection of the binding constraints.
3
Evaluate feasible integer coordinates near the intersection boundary.
For U=7U = 7: Sleqmin(frac40352,3028)=min(2.5,2)=2implies(2,7)S \\leq \\min(\\frac{40 - 35}{2}, 30 - 28) = \\min(2.5, 2) = 2 \\implies (2, 7). Profit = 100(2)+350(7)=100(2) + 350(7) = \\ 2,650 .For. For U = 6 :: S \\leq \\min(\\frac{40 - 30}{2}, 30 - 24) = \\min(5, 6) = 5 \\implies (5, 6).Profit=. Profit = 100(5) + 350(6) = \\2,6002,600.
Since production quantities must be integers, testing feasible boundary pairs determines the global optimum.

Key Concept

Optimization under Bounded Linear Constraints
Question 2193Question

A regional emergency health network deploys two types of mobile medical units for event coverage: Rapid Response Units (RR) and Heavy Support Units (HH).

The deployment is governed by the following staffing and operational constraints:
- Each Rapid Response Unit (RR) requires 11 paramedic and 22 EMTs.
- Each Heavy Support Unit (HH) requires 33 paramedics and 11 EMT.
- On any given shift, a maximum of 2121 paramedics and 2222 EMTs are available.
- Operational policy mandates deploying at least 33 Rapid Response Units (R3R \ge 3) and at least 22 Heavy Support Units (H2H \ge 2).

Each Rapid Response Unit can treat 1010 patients per hour, and each Heavy Support Unit can treat 1515 patients per hour.

Match each operational metric on the left to its corresponding optimal value on the right that maximizes total patient treatment capacity per hour.

Click a left item, then click its matching right item

Items

Optimal number of Rapid Response Units (RR)
Optimal number of Heavy Support Units (HH)
Maximum total patient treatment capacity per hour

Matches

Show answer & explanation

Answer

The optimal operational configuration pairs 9 Rapid Response Units with 4 Heavy Support Units, achieving a maximum treatment capacity of 150 patients per hour.
The optimal pairing matches 9 Rapid Response Units, 4 Heavy Support Units, and a total capacity of 150 patients per hour. The optimal point (9,4)(9, 4) fully utilizes both available resource pools (1(9)+3(4)=211(9) + 3(4) = 21 paramedics and 2(9)+1(4)=222(9) + 1(4) = 22 EMTs), maximizing total throughput 10R+15H10R + 15H.

Step-by-Step Solution

1
Set up the linear inequality constraints and objective function.
Paramedic resource constraint: R+3H21R + 3H \le 21; EMT resource constraint: 2R+H222R + H \le 22; Operational bounds: R3,H2R \ge 3, H \ge 2; Objective function to maximize: C=10R+15HC = 10R + 15H.
Translating the narrative conditions into algebraic forms defines the feasible region of operation.
2
Calculate the corner vertices of the bounded feasible polygon.
Solving R+3H=21R + 3H = 21 and 2R+H=222R + H = 22 simultaneously yields R=9R = 9 and H=4H = 4. Other extreme vertices defined by lower bounds are (3,6)(3, 6), (3,2)(3, 2), and (10,2)(10, 2).
Linear programming optimization principles guarantee that the maximum objective value occurs at one of the corner vertices of the feasible region.
3
Evaluate the capacity objective function C(R,H)=10R+15HC(R, H) = 10R + 15H at each vertex.
At (3,2):10(3)+15(2)=60(3, 2): 10(3) + 15(2) = 60; At (3,6):10(3)+15(6)=120(3, 6): 10(3) + 15(6) = 120; At (10,2):10(10)+15(2)=130(10, 2): 10(10) + 15(2) = 130; At (9,4):10(9)+15(4)=150(9, 4): 10(9) + 15(4) = 150.
Comparing capacities across all vertices establishes (9,4)(9, 4) as the global maximum.

Key Concept

Linear Programming Optimization under Bounded System Constraints
Question 2194Question

A renewable energy company designs micro-grid installations containing two types of modular components: Battery Storage Units (BB) and Solar Inverter Modules (II). The installation configuration is subject to the following system constraints:

1. Budget Bound: Each Battery Storage Unit costs \4,000andeachInverterModulecosts$2,000.Thetotalinstallationbudgetcannotexceed$32,000,givingtheconstraint4,000 and each Inverter Module costs \$2,000. The total installation budget cannot exceed \$32,000, giving the constraint 2B + I \le 16 .2.PeakPowerRequirement:Tomeetgridstabilityrequirements,thecombinedsystemratingmustsatisfy. 2. **Peak Power Requirement**: To meet grid stability requirements, the combined system rating must satisfy 3B + 4I \ge 30 .3.PhysicalSpaceLimit:Duetofloorloadcapacity,amaximumof6BatteryStorageUnitscanbeinstalled(. 3. **Physical Space Limit**: Due to floor load capacity, a maximum of 6 Battery Storage Units can be installed ( B \le 6$).

The total daily credit rating generated by the installation is given by the objective function E=12B+5IE = 12B + 5I.

Which combination of Battery Storage Units (BB) and Solar Inverter Modules (II) satisfies all system constraints while maximizing the total daily credit rating EE?

Show answer & explanation

Answer: 6 Battery Storage Units and 4 Inverter Modules

Answer

6 Battery Storage Units and 4 Inverter Modules
The combination of 6 Battery Storage Units and 4 Inverter Modules strictly satisfies all three constraints: the space constraint (666 \le 6), the budget constraint (2(6)+4=16162(6) + 4 = 16 \le 16), and the peak power requirement (3(6)+4(4)=34303(6) + 4(4) = 34 \ge 30). Substituting these values into the credit rating function yields E=12(6)+5(4)=92E = 12(6) + 5(4) = 92, which is higher than any other feasible combination.

Step-by-Step Solution

1
Identify the feasible values for BB based on bounded constraints.
The physical space constraint limits BB to non-negative integers where B6B \le 6.
Establishing individual bounds reduces the search space for integer solutions.
2
Evaluate upper bounds for II using the budget constraint I162BI \le 16 - 2B for candidate values of BB.
For B=6B = 6, I1612=4I \le 16 - 12 = 4. For B=5B = 5, I1610=6I \le 16 - 10 = 6. For B=4B = 4, I168=8I \le 16 - 8 = 8.
Determines maximum allowable Inverter Modules for each valid count of Battery Storage Units.
3
Check peak power constraint 3B+4I303B + 4I \ge 30 and compute objective function E=12B+5IE = 12B + 5I for feasible candidate pairs.
Pair (6,4)(6, 4): 3(6)+4(4)=34303(6) + 4(4) = 34 \ge 30, E=12(6)+5(4)=92E = 12(6) + 5(4) = 92.
Pair (5,6)(5, 6): 3(5)+4(6)=39303(5) + 4(6) = 39 \ge 30, E=12(5)+5(6)=90E = 12(5) + 5(6) = 90.
Pair (4,8)(4, 8): 3(4)+4(8)=44303(4) + 4(8) = 44 \ge 30, E=12(4)+5(8)=88E = 12(4) + 5(8) = 88.
Testing valid candidates against all joint constraints identifies the configuration yielding maximum credits.
4
Compare total daily credit ratings across all valid choices.
The maximum credit rating is 92, achieved at B=6B = 6 and I=4I = 4.
Confirms the optimal bounded solution.

Key Concept

Optimization under Bounded Linear Constraints
Estimated Time:2m 0s
Question 2195Question

A fintech corporation tracks server performance metrics across five regional data centers: Region Alpha, Region Beta, Region Gamma, Region Delta, and Region Epsilon.

The table below presents Q3 transaction processing latency and cluster allocations:

Data CenterAverage Transaction Latency (ms)Active Server Clusters
Region Alpha12015
Region Beta8510
Region Gamma15020
Region Delta9512
Region Epsilon11014
Additionally, graphical analysis indicates that monthly operational expenses (yy, in thousands of dollars) correlate linearly with active server clusters (xx) according to the line of best fit y=4.5x+10y = 4.5x + 10.

Which of the following correctly pairs the data center with the lowest latency per active server cluster and its predicted monthly operational expense (in thousands of dollars)?

Show answer & explanation

Answer: Region Gamma; $100 thousand

Answer

Region Gamma; $100 thousand
Evaluating the latency per active server cluster for each data center yields 8.08.0 ms for Region Alpha, 8.58.5 ms for Region Beta, 7.57.5 ms for Region Gamma, 7.927.92 ms for Region Delta, and 7.867.86 ms for Region Epsilon. Region Gamma exhibits the lowest rate (7.57.5 ms per cluster). Applying its 2020 active server clusters to the graphical trend line y=4.5x+10y = 4.5x + 10 gives y=4.5(20)+10=100y = 4.5(20) + 10 = 100 thousand dollars.

Step-by-Step Solution

1
Calculate the latency per active server cluster for each data center using table data.
Region Alpha: 120/15=8.0120 / 15 = 8.0 ms/cluster; Region Beta: 85/10=8.585 / 10 = 8.5 ms/cluster; Region Gamma: 150/20=7.5150 / 20 = 7.5 ms/cluster; Region Delta: 95/127.9295 / 12 \approx 7.92 ms/cluster; Region Epsilon: 110/147.86110 / 14 \approx 7.86 ms/cluster.
Dividing latency by active server clusters isolates efficiency per unit cluster.
2
Identify the data center with the minimum ratio.
Region Gamma has the lowest latency per active server cluster at 7.57.5 ms/cluster.
Comparing calculated rates reveals the minimum value.
3
Use the linear model equation y=4.5x+10y = 4.5x + 10 to find the operational expense for Region Gamma.
Substitute x=20x = 20 active server clusters into the trend equation: y=4.5(20)+10=90+10=100y = 4.5(20) + 10 = 90 + 10 = 100.
Region Gamma operates 2020 active server clusters.

Key Concept

Integrated Table and Graphical Analysis
Estimated Time:2m 0s
PreviousPage 110 / 110
All practice questions — GMAT | Examkin