Class 12

31. Linear Programming question bank (Maths)

Practice 361 free Class 12 Maths - 31. Linear Programming questions with answers and step-by-step solutions.

Start free Book a demo
All Easy Hard Medium
Q1.

Which of the following is true?

(A)
In an L.P.P., the constraints are always given by linear inequations.
(B)
The bounded feasible region for an L.P.P. is a convex polygon.
(C)
The minimum value of an objective function \( z = ax + by \) in an L.P.P. always occurs at only one corner point of the feasible region.
(D)
If the feasible region of an L.P.P. is bounded, then the objective function \( z = ax + by \) has both maximum and minimum.
Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
Q2.

Which of the following is true?

(A)
If the feasible region for an L.P.P. is unbounded, then the max/min of the objective function \( ax + by \) may or may not exist.
(B)
A feasible region of a system of linear inequalities is bounded if it can be enclosed within a closed curve.
(C)
In an L.P.P. the minimum value of an objective function \( z = ax + by \) is always 0 if origin is one of the corner points of the feasible region.
(D)
None of these
Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
Protected Questions

Unlock All 143 Questions in 31. Linear Programming

Log in or sign up free to access every question with complete solutions, create chapter practice tests, and track your performance.

Sign in to unlock Create free account

Sign up free to access all 143 questions

Unlock every 31. Linear Programming question, generate papers, and practice at your own pace.

Start free