Linear Programming

Q1.The conditions like x ≥ 0, y ≥ 0 in a linear programming problem are called:

• AObjective constraints
• BFeasible conditions
• CNon-negative restrictions
• DBoundary conditions

Q2.Maximise Z = 4x + y subject to x+y ≤ 50, 3x+y ≤ 90, x ≥ 0, y ≥ 0. Which corner point gives the maximum?

• A(0, 0)
• B(0, 50)
• C(20, 30)
• D(30, 0)

Q3.A corner point of the feasible region is defined as:

• AAny interior point of the region
• BThe centroid of the feasible region
• CA point that is the intersection of two boundary lines
• DThe midpoint of a boundary edge

Q4.The linear function Z = ax + by that is to be maximised or minimised in an LPP is called the:

• AConstraint function
• BDecision variable
• CObjective function
• DFeasibility function

Q5.In Example 4 of the textbook (Z = -50x + 20y, unbounded region), the corner point (6,0) gives Z = -300. Why is -300 NOT the minimum?

• ABecause it is the smallest value among corner points
• BBecause the half plane -50x+20y < -300 has common points with the feasible region
• CBecause the region is bounded
• DBecause there are other corner points with smaller Z