LINEAR PROGRAMMING

• (A)

• (B)

• (C)

• (D)

If the feasible region for a LPP is unbounded, maximum or minimum of the

objective function Z = ax + by may or may not exist.

• TRUE

• FALSE

Tags

CCSS.8.EE.C.8B

Maximum value of the objective function Z = ax + by in a LPP always occurs at

only one corner point of the feasible region.

• TRUE

• FALSE

The feasible region for an LPP is always a _________ polygon.

• CONCAVE

• CONVEX

Tags

CCSS.HSA.REI.D.12

In a LPP, the linear inequalities or restrictions on the variables are called

_________.

• Linear constraints

• Quadratic constraints

• Cubic constraints

• none of these

A manufacturing company makes two types of television sets; one is black and white (x) and the other is colour (y). The company has resources to make at most 300 sets a week. It takes Rs 1800 to make a black and white set and Rs 2700 to make a coloured set. The company can spend not more than Rs 648000 a week to make television sets. Constraints are

• $x+y\le300,\ 2x+3y\le720$

• $x+y\le300,\ 2x+3y\ge720$

• $x+y\ge300,\ 2x+3y\le720$

• $x+y\ge300,\ 2x+3y\ge720$

Sarah makes small purses (x) and big purses (y). She can make no more than 8 purses a week.
Which inequality represents the situation?

• x + y ≤ 8
• x + y ≤ 6
• 2x + 3y ≤ 6
• x + y ≤ 10

It takes Sarah 2 hours to make small purses (x) and 3 hours to make big purses (y). She has a maximum of 18 hours a week. Which inequality represents this situation?

• 2x + 3y ≤ 18

• x + y ≤ 6

• x + y ≤ 9

• 3x + 2y ≤ 18