Min and max problems
49 flashcards covering Min and max problems for the GMAT Quantitative section.
Min and max problems involve finding the smallest or largest possible values of a quantity, often under specific constraints. For instance, you might need to minimize costs in a business scenario or maximize area with limited resources. These problems typically use algebra, inequalities, or basic geometry to set up equations and determine optimal values, helping you build skills in logical reasoning and problem-solving.
On the GMAT Quantitative section, min and max questions appear in problem-solving and data sufficiency formats, testing your ability to handle word problems, inequalities, and functions. Common traps include overlooking constraints or assuming variables can take any value, which can lead to incorrect answers. Focus on identifying key conditions, testing boundary values, and verifying solutions through substitution. Always check boundary values for accuracy.
Terms (49)
- 01
Minimum value of a function
The minimum value is the smallest output of a function within its domain, often found by evaluating critical points or using algebraic methods like completing the square.
- 02
Maximum value of a function
The maximum value is the largest output of a function within its domain, typically identified through analysis of endpoints, vertices, or constraints in problems.
- 03
Vertex of a parabola
For a quadratic equation y = ax^2 + bx + c, the vertex is the point where the parabola reaches its minimum if a > 0 or maximum if a < 0, located at x = -b/(2a).
- 04
Axis of symmetry for quadratics
The axis of symmetry is the vertical line that divides a parabola into two mirror-image halves, given by x = -b/(2a) for y = ax^2 + bx + c.
- 05
Completing the square for minimums
Completing the square rewrites a quadratic equation in the form y = a(x - h)^2 + k, where k is the minimum value if a > 0, allowing easy identification of the vertex.
- 06
Discriminant in quadratics
The discriminant, b^2 - 4ac for ax^2 + bx + c = 0, determines the nature of roots and helps assess if a quadratic has real values that could relate to minimum or maximum points.
- 07
AM-GM Inequality for minimums
The Arithmetic Mean-Geometric Mean Inequality states that for non-negative numbers, the arithmetic mean is at least the geometric mean, often used to find minimum values in optimization problems.
- 08
Feasible region in inequalities
The feasible region is the set of points that satisfy all given inequalities, and the minimum or maximum value of an objective function occurs at a vertex of this region.
- 09
Objective function in optimization
In linear programming, the objective function is the expression to minimize or maximize, subject to constraints, and its value is evaluated at the feasible region's boundaries.
- 10
Constraints in min-max problems
Constraints are inequalities or equations that limit the possible values of variables, and ignoring them can lead to incorrect minimum or maximum solutions.
- 11
Substitution method for systems
The substitution method solves systems of equations to find variable values that satisfy all equations, which can then be used to determine minimum or maximum outcomes.
- 12
Elimination method for systems
The elimination method adds or subtracts equations to eliminate variables, helping find intersection points that may represent minimum or maximum values.
- 13
Range of a quadratic function
The range of a quadratic function y = ax^2 + bx + c is all y-values from the vertex upward if a > 0, or downward if a < 0, defining possible minimum or maximum outputs.
- 14
End behavior of polynomials
End behavior describes how a polynomial function approaches positive or negative infinity as x increases or decreases, influencing whether a maximum or minimum exists.
- 15
Absolute value minimum
The minimum value of an absolute value expression like |x - a| is 0, occurring when x = a, and it increases as x moves away from a.
- 16
Profit maximization
Profit maximization involves finding the production level that yields the highest profit, often by setting revenue equal to costs and solving for the vertex of a quadratic.
- 17
Cost minimization
Cost minimization seeks the lowest total cost under constraints, such as using inequalities to find the point where costs are optimized without exceeding resources.
- 18
Break-even point
The break-even point is where revenue equals costs, and it can be a reference for determining minimum sales needed before profit maximization is possible.
- 19
Domain restrictions in functions
Domain restrictions limit the inputs of a function, and they must be considered when determining if a minimum or maximum value is achievable within the allowed values.
- 20
Increasing and decreasing intervals
A function is increasing on an interval if its values rise with x and decreasing if they fall, helping identify where minimum or maximum points occur.
- 21
Minimum distance problems
Minimum distance problems involve finding the shortest distance between points or lines, often using the distance formula and minimizing a quadratic expression.
- 22
Pythagorean theorem in optimization
The Pythagorean theorem calculates distances in right triangles, which can be minimized or maximized in geometry problems involving paths or perimeters.
- 23
Area maximization for rectangles
For a rectangle with fixed perimeter, the maximum area occurs when it is a square, found by setting up and solving a quadratic equation.
- 24
Perimeter minimization
Perimeter minimization might involve enclosing a fixed area with the least fencing, leading to a square shape as the optimal solution.
- 25
Graphical solution for inequalities
Graphing inequalities shades the feasible region, and the minimum or maximum of a linear function is found at the vertices of the shaded area.
- 26
Common trap: Ignoring constraints
A common error is solving for an unconstrained minimum or maximum, which may not be feasible, so always check against given inequalities.
- 27
Factoring quadratics for roots
Factoring a quadratic like x^2 - 5x + 6 = 0 reveals roots that help determine the intervals where the function is positive or negative, affecting min-max.
- 28
Symmetric properties of parabolas
Parabolas are symmetric about their axis, so the minimum or maximum at the vertex is equidistant from points on either side.
- 29
Linear programming basics
Linear programming optimizes a linear objective function subject to linear constraints, with solutions at corner points of the feasible region.
- 30
Shadow prices in constraints
In optimization, shadow prices represent the change in the objective function per unit change in a constraint, though not always directly tested.
- 31
Monotonic functions and extrema
A monotonic function, either always increasing or decreasing, has no local minimum or maximum except possibly at endpoints.
- 32
Quadratic formula for extrema
The quadratic formula x = [-b ± sqrt(b^2 - 4ac)] / (2a) finds roots, which bracket the vertex and thus the minimum or maximum.
- 33
Efficiency in word problems
In efficiency problems, minimizing time or maximizing output often involves setting up equations based on rates and solving for optimal values.
- 34
Rate of change in functions
The rate of change indicates how a function's value shifts, helping identify points where it levels off for a minimum or maximum.
- 35
Bounded vs. unbounded functions
A bounded function has upper and lower limits, allowing for minimum and maximum values, while an unbounded one may not.
- 36
Optimization with absolute values
Absolute value functions create V-shaped graphs, with the minimum at the vertex and no maximum unless restricted by domain.
- 37
Strategy for multi-variable min-max
For problems with multiple variables, express one in terms of others using constraints, then minimize or maximize the resulting single-variable function.
- 38
Common trap: Misidentifying vertex
Confusing the vertex formula can lead to errors, so remember it's x = -b/(2a) for the exact point of minimum or maximum.
- 39
Example: Minimize x^2 + 4x + 4
To minimize x^2 + 4x + 4, rewrite as (x + 2)^2, which has a minimum of 0 at x = -2.
The expression equals 0 when x = -2 and is positive otherwise.
- 40
Maximizing revenue from price
Revenue is maximized when marginal revenue equals marginal cost, but on GMAT, solve the quadratic for price that yields peak revenue.
- 41
Minimum of linear functions
Linear functions have no minimum or maximum over an unbounded domain, but constraints create a minimum at a boundary point.
- 42
Using calculus-free derivatives
Approximate rates of change by evaluating function differences to locate potential minimum or maximum points without formal calculus.
- 43
Optimization in geometry: Circles
For a fixed circumference, the circle maximizes area, found by comparing shapes or using formulas in problems.
- 44
Inequality systems for regions
Solving systems of inequalities defines the feasible region, and testing vertices gives the minimum or maximum value.
- 45
Trap: Assuming global minimum
Not all local minima are global, so evaluate all critical points within constraints to find the true minimum.
- 46
Parametric optimization
In parametric problems, vary a parameter to find values that minimize or maximize an expression, like in related rates without calculus.
- 47
Example: Max area of a triangle
For a triangle with fixed base, maximum area occurs when height is maximized, such as in a right triangle setup.
With base 10, height 5 gives area 25, but constraints might limit it.
- 48
Second-degree inequalities
Second-degree inequalities define regions where a quadratic is positive or negative, helping locate minimum values above or below zero.
- 49
Balanced allocation for minimum
In allocation problems, distributing resources equally often minimizes variance or total cost, as per AM-GM.