Solveeit Logo

Question

Mathematics Question on Linear Programming Problem

Fill in the blanks (i) (i) In a LPPLPP, the objective function is always (ii)(ii) The feasible region for a LPPLPP is always a polygon. (iii)(iii) A feasible region of a system of linear inequalities is said to be , if it can be enclosed within a circle. (iv)(iv) In a LPPLPP, if the objective function Z=ax+byZ = ax + by has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same value.

A

a

B

b

C

c

D

d

Answer

d

Explanation

Solution

(i)(i) In a LPPLPP, objective function is always linear. (ii)(ii) The feasible region for a LPPLPP is always a convex polygon. (iii)(iii) A feasible region of a system of linear inequalities is said to be bounded, if it can be enclosed within a circle. (iv) (iv) In a LPPLPP, if the objective function Z=ax+byZ = ax + by has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same maximum value.