Difficulty: Easy & Basic
Which method helps allocate limited resources to achieve the best outcome?
A Simple interest
B Index numbers
C Cash budgeting
D Linear programming
Answer: D. Linear programming Linear programming optimizes a linear objective while respecting stated resource constraints.
In an LPP, decision variables represent what?
A Known resource limits
B Fixed selling prices
C Unknown activity levels
D Past production totals
Answer: C. Unknown activity levels Decision variables are the quantities to be chosen, such as units of each product.
What is the expression being maximized or minimized called?
A Feasible region
B Objective function
C Non-negativity rule
D Boundary equation
Answer: B. Objective function The objective function measures the quantity, such as profit or cost, to optimize.
How are limits on resources represented in an LPP?
A Linear constraints
B Decision labels
C Objective values
D Corner coordinates
Answer: A. Linear constraints Constraints express resource limits or requirements as linear equations or inequalities.
A set of variable values satisfying every constraint is a what?
A Objective function
B Feasible solution
C Redundant constraint
D Unbounded objective
Answer: B. Feasible solution A feasible solution obeys all constraints, including any non-negativity conditions.
A point that violates at least one constraint is what?
A Optimal solution
B Corner point
C Infeasible solution
D Objective value
Answer: C. Infeasible solution A solution is infeasible when it fails even one required constraint.
What is a feasible solution that gives the best objective value?
A Boundary equation
B Optimal solution
C Feasible region
D Decision variable
Answer: B. Optimal solution An optimal solution is feasible and maximizes or minimizes the objective as required.
The common set of points satisfying all constraints is the what?
A Decision vector
B Objective function
C Coefficient table
D Feasible region
Answer: D. Feasible region The feasible region is the intersection of the half-planes defined by all constraints.
For production quantities, which restriction is commonly imposed?
A Negative capacities
B Fractional profits
C Changing coefficients
D Non-negative variables
Answer: D. Non-negative variables Production quantities are usually restricted to zero or positive values.
With two decision variables, a graphical LPP uses which plane?
A Number line
B x-y coordinate plane
C Three-dimensional space
D Complex plane
Answer: B. x-y coordinate plane Two decision variables can be plotted as points in the x-y plane.
An LPP objective must have what form?
A Quadratic expression
B Trigonometric expression
C Exponential expression
D Linear expression
Answer: D. Linear expression Linearity means each variable appears to the first power without products between variables.
A resource is available for no more than 40 hours. Which relation fits?
A Resource use ≤ 40
B Resource use ≥ 40
C Resource use = 0
D Resource use ≠ 40
Answer: A. Resource use ≤ 40 A maximum capacity is represented by a less-than-or-equal-to constraint.
A plan must produce at least 20 units. Which relation fits?
A Output ≥ 20
B Output ≤ 20
C Output = 0
D Output ≠ 20
Answer: A. Output ≥ 20 A minimum requirement uses a greater-than-or-equal-to constraint.
A vertex formed by two boundary lines is commonly called what?
A Objective value
B Decision coefficient
C Corner point
D Resource surplus
Answer: C. Corner point A corner point is a feasible-region vertex where boundary lines meet.
For a graphical LPP with an attained optimum, where can an optimum be found?
A At every point
B Only at the origin
C Outside the region
D At a corner point
Answer: D. At a corner point The corner-point theorem says an attained optimum occurs at a vertex of the feasible region.
Evaluate z = 2x + 3y at (1, 2)
A 5
B 7
C 8
D 9
Answer: C. 8 Substituting x=1 and y=2 gives 2(1)+3(2)=8.
The boundary of x + y ≤ 5 is which equation?
A x − y = 5
B x + y < 5
C x + y = 5
D x + y = 0
Answer: C. x + y = 5 Replacing the inequality sign with equality gives its boundary line.
The x-axis intercept of 2x + y = 8 is which point?
A (4, 0)
B (8, 0)
C (0, 4)
D (0, 8)
Answer: A. (4, 0) Set y=0 to obtain 2x=8, so x=4.
The y-axis intercept of 3x + 2y = 12 is which point?
A (4, 0)
B (0, 6)
C (6, 0)
D (0, 4)
Answer: B. (0, 6) Set x=0 to obtain 2y=12, so y=6.
With x + y ≥ 5 and x,y ≥ 0, the origin is what?
A A corner maximum
B Feasible
C Optimal
D Infeasible
Answer: D. Infeasible At (0,0), x+y is 0, which fails the requirement that it be at least 5.
With x + y ≤ 5 and x,y ≥ 0, is (2,3) feasible?
A Yes, on boundary
B No, exceeds limit
C Only if x is negative
D No, below origin
Answer: A. Yes, on boundary At (2,3), the sum is 5, so the point satisfies the boundary constraint.
For minimizing total production expense, what is usually optimized?
A Total cost
B Feasible-region area
C Variable names
D Number of constraints
Answer: A. Total cost A cost-minimization model places total cost in its objective function.
Which points are feasible when several constraints apply?
A Any one half-plane
B Their common intersection
C All plotted points
D Only boundary points
Answer: B. Their common intersection A feasible point must lie in every constraint half-plane at the same time.
A constraint with variables only to the first power is what?
A Quadratic constraint
B Exponential constraint
C Linear constraint
D Circular constraint
Answer: C. Linear constraint A linear constraint has variables of degree one and forms a straight boundary line.
If the constraints have no common point, the LPP has what?
A No feasible solution
B A unique maximum
C An unbounded minimum
D A redundant objective
Answer: A. No feasible solution Without a common feasible point, there is no solution satisfying all constraints.