[go: up one dir, main page]
Scribd
Upload
22 views1 page

LPP Ws

The document contains multiple-choice and short answer questions related to linear programming (LP) problems, focusing on concepts such as feasible solutions, objective functions, and corner points of feasible regions. It includes specific problems about cake preparation based on ingredient constraints and calculations for maximizing or minimizing objective functions. The questions test understanding of LP principles and require analytical problem-solving skills.

Uploaded by

singhujjwal068
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views1 page

LPP Ws

The document contains multiple-choice and short answer questions related to linear programming (LP) problems, focusing on concepts such as feasible solutions, objective functions, and corner points of feasible regions. It includes specific problems about cake preparation based on ingredient constraints and calculations for maximizing or minimizing objective functions. The questions test understanding of LP principles and require analytical problem-solving skills.

Uploaded by

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

Q.

No Question
MULTIPLE CHOICE QUESTIONS
1. One kind of cake requires 300 g of flour and 15 g of fat. Another kind of cake requires 150 g of
flour and 30 g of fat. Assuming that there is no shortage of other ingredients used in making the
cakes, the maximum number of cakes that can be prepared from 7.5 kg of flour and 600 g of fat
is:
(a) 20 (b) 25 (c) 30 (d) 40
2. The optimal value of the objective function is attained at the points:
(a) given by intersection of lines representing inequations with axes only
(b) given by intersection of lines representing inequations with X-axis only
(c) given by corner points of the feasible region
(d) at the origin
3. A feasible solution to an LP problem,
(a) must satisfy all of the problem’s constraints simultaneously
(b) need not satisfy all of the constraints, only some of them.
(c) must be a corner point of the feasible region.
(d) must optimize the value of the objective function.
4. For the LP problem Minimize z = 2x + 3y the coordinates of the corner points of the bounded
feasible region are A (3, 3), B(20,3), C(20, 10), D(18, 12) and E(12, 12). The minimum value of z
is
(a) 49 (b) 15 (c)10 (d) 5
5. For the LP problem maximize z = 2x + 3y The coordinates of the corner points of the bounded
feasible region are A(3, 3), B(20,3), C(20, 10), D(18, 12) and E(12, 12). The minimum value of z
is
(a) 72 (b) 80 (c) 82 (d) 70
6. Corner points of the bounded feasible region for an LP problem are (0, 4), (6, 0), (12, 0), (12, 16)
and (0, 10). Let z=8x + 12y be the objective function. Match the following: (i) Minimum value of
z occurs at _____ (ii) Maximum value of z occurs at _____ (iii) Maximum of z is _____ (iv)
Minimum of z is _____
(a) (i) (6, 0) (ii) (12, 0) (iii) 288 (iv) 48 (b) (i) (0, 4) (ii) (12, 16) (iii) 288 (iv) 48
(c) (i) (0, 4) (ii) (12, 16) (iii) 288 (iv) 96 (d) (i) (6, 0) (ii) (12, 0) (iii) 288 (iv) 96
SHORT ANSWER TYPE (2/3 MARK QUESTIONS)
7.In below mentioned figure, the feasible region (shaded) for a LPP is shown. Determine the maximum
and minimum value of Z = x + 2y

You might also like