Linear Programming MCQs (Set-1)

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

In an LPP, decision variables represent what?

A Known resource limits
B Fixed selling prices
C Unknown activity levels
D Past production totals

What is the expression being maximized or minimized called?

A Feasible region
B Objective function
C Non-negativity rule
D Boundary equation

How are limits on resources represented in an LPP?

A Linear constraints
B Decision labels
C Objective values
D Corner coordinates

A set of variable values satisfying every constraint is a what?

A Objective function
B Feasible solution
C Redundant constraint
D Unbounded objective

A point that violates at least one constraint is what?

A Optimal solution
B Corner point
C Infeasible solution
D Objective value

What is a feasible solution that gives the best objective value?

A Boundary equation
B Optimal solution
C Feasible region
D Decision variable

The common set of points satisfying all constraints is the what?

A Decision vector
B Objective function
C Coefficient table
D Feasible region

For production quantities, which restriction is commonly imposed?

A Negative capacities
B Fractional profits
C Changing coefficients
D Non-negative variables

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

An LPP objective must have what form?

A Quadratic expression
B Trigonometric expression
C Exponential expression
D Linear expression

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

A plan must produce at least 20 units. Which relation fits?

A Output ≥ 20
B Output ≤ 20
C Output = 0
D Output ≠ 20

A vertex formed by two boundary lines is commonly called what?

A Objective value
B Decision coefficient
C Corner point
D Resource surplus

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

Evaluate z = 2x + 3y at (1, 2)

A 5
B 7
C 8
D 9

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

The x-axis intercept of 2x + y = 8 is which point?

A (4, 0)
B (8, 0)
C (0, 4)
D (0, 8)

The y-axis intercept of 3x + 2y = 12 is which point?

A (4, 0)
B (0, 6)
C (6, 0)
D (0, 4)

With x + y ≥ 5 and x,y ≥ 0, the origin is what?

A A corner maximum
B Feasible
C Optimal
D Infeasible

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

For minimizing total production expense, what is usually optimized?

A Total cost
B Feasible-region area
C Variable names
D Number of constraints

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

A constraint with variables only to the first power is what?

A Quadratic constraint
B Exponential constraint
C Linear constraint
D Circular constraint

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