0% found this document useful (0 votes)
1 views

Linear Programming Problem DPP 01 (of Lec 02).PDF

The document contains a series of questions and answers related to Linear Programming Problems (LPP) for a 12th-grade commerce class. It covers concepts such as feasible solutions, optimal solutions, constraints, and objective functions. Additionally, it provides hints and solutions for each question, along with an answer key.

Uploaded by

Yash Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
1 views

Linear Programming Problem DPP 01 (of Lec 02).PDF

The document contains a series of questions and answers related to Linear Programming Problems (LPP) for a 12th-grade commerce class. It covers concepts such as feasible solutions, optimal solutions, constraints, and objective functions. Additionally, it provides hints and solutions for each question, along with an answer key.

Uploaded by

Yash Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Commerce

Parishram 2026 class 12th Commerce (Kautilya)


Core Maths DPP: 1

Linear Programming Problem

Q1 A set of values of decision variables that (B) Given by the intersection of inequations
satisfies the linear constraints and non- with X - axis only
negativity conditions of an L.P.P. is called its: (C) Given by corner points of the feasible
(A) Unbounded solution region
(B) Optimum solution (D) None of the above
(C) Feasible solution
Q7 The graph of the inequations x 0, y 0 and
(D) None
3 x+4 y 12 is
Q2 Which of the following statement is correct? (A) Interior of a triangle including the points on
(A) Every LPP admits an optimal solution the sides
(B) Every LPP admits unique optimal solution (B) In second quadrent
(C) If a LPP gives two it has infinite (C) Exterior of a triangle
optimal solutions number of solutions (D) None of these
(D) None
Q8 In a L.P.P., the linear function which has to be
Q3 In an LPP, the objective function is always maximised or minimised is called a linear
(A) Non-linear (B) Linear ______ function.
(C) Quadratic (D) Cubic (A) objective
(B) equation
Q4 In maximisation problem, optimal solution
(C) finite
occuring at corner point yields the
(D) None of the above
(A) highest value of Z
(B) lowest value of Z Q9 The solution set of the inequation
(C) Mid value of Z is
(D) None (A) Half plane not containing the origin
(B) Half plane containing the origin
Q5 The linear inequalities or equations or
(C) The point being on the line
restrictions on the variables of a linear
(D) None of these
programming problem are called:
(A) A constraint Q10 The objective function of a linear programming
(B) Decision variables problem is
(C) Objective function (A) A constraint
(D) None of the above (B) Function to be optimised
(C) A relation between the variable
Q6 The optimal value of the objective function is
(D) None of these
attained a at the point is
(A) Given by the intersection of inequations Q11 If the feasible region for a L.P.P. is
with axes only _________then the optimal value of the objective

Android App | iOS App | PW Website


Commerce

function may or máy not exist.


(A) Unbounded
(B) Bounded
(C) feasible
(D) None of the above

Q12 The point which does not lie in the half plane
is
(A)

(B) The equation of the line BC is


(A) x+20 y=40 (B) x+2 y=40
(C) (C) 3x+2 y=40 (D) 4x+2 y=40

Q15 The feasible region for an L.P.P is shown in the


(D) figure given below:

Q13 In a L.P.P., the maximum value of the objective


function Z = ax + by is always.
(A) Infinite
(B) Finite
(C) Not defined
(D) None of the above

Q14 The feasible region for an L.P.P is shown in the


figure given below:
The maximum value of the objective function Z
= 3x+ 4y is
(A) 200 (B) 100
(C) 67 (D) 99

Android App | iOS App | PW Website


Commerce

Answer Key
Q1 C Q9 A

Q2 B Q10 B
Q3 B Q11 A
Q4 A Q12 C
Q5 A Q13 B
Q6 C Q14 B

Q7 A Q15 B
Q8 A

Android App | iOS App | PW Website


Commerce

Hints & Solutions


Note: scan the QR code to watch video solution

Q1 Text Solution: objective function.


Feasible solution Q9 Text Solution:
Q2 Text Solution: Half plane not containing the origin
Every LPP admits unique optimal solution Q10 Text Solution:
Q3 Text Solution: Function to be optimised
In an LPP, the objective function is Q11 Text Solution:
always Linear. If the feasible region for a L.P.P. is unbounded
Q4 Text Solution: then the optimal value of the objective
In maximisation problem, optimal solution function may or máy not exist.
occuring at corner point yields the highest
Q12 Text Solution:
value of Z.
Putting (2, 3) in which becomes:
Q5 Text Solution: and
The linear inequalities or equations or not .
restrictions on the variables of a linear
Q13 Text Solution:
programming problem are called constraints.
In a L.P.P., the maximum value of the objective
Q6 Text Solution:
function Z = ax + by is always finite
Given by corner points of the feasible region.
Q14 Text Solution:
The optimal value of the objective function is
attained at the point is given by corner points The equation of the line is
of the feasible region. i.e. .

Q7 Text Solution: Option (2) is the correct answer.


Given inequalities Q15 Text Solution:
The corner points of the feasible region are
Now, take and , and .
When Objective function is .
When The values of at the corner points are:
So, the points are and at ,
at ,
So, the graph of the inequations at ,
, At .
is interior of a triangle The maximum value of the objective function
including the points on the sides. is 100 and it is attained at the
point B.
Q8 Text Solution: Option (2) is the correct answer.
In a L.P.P., the linear function which has to be
maximised or minimised is called a linear

Android App | iOS App | PW Website

You might also like