Linear Programming

---

Question

---

Question 1 :

In a LPP, The linear function which has to be maximized (or) minimized is called a linear function

1. Objective
2. Feasible
3. Subjective
4. contraints
Answer
7003

Question 2 :

A firm manufacturing two types of electrical items A and B can make a profit  of Rs 160 per unit of ‘A’ and Rs. 240/-  per unit of B both A and B make use of two essential components a motor and transformer each unit of A requires 3 motors and 2 transformers and each unit of B requires 2 motors and 4 transformers the total supply of components per month is restricted to 210 motors and 300 transformers if x and y denoted. The number of items A and B which the firm should produce in order to maximize the profit then the objective function is

1. z = 3x +2y
2. z = 2x + 4y
3. z = 210x + 300y
4. z = 160x + 240y
Answer
7004

Question 3 :

The optional value of the objective function in attained at the points

1. on x - axis
2. on y - axis
3.

which are at the corner-points of the feasible region
4.

which are at the points of intersection of the in equation with; y - axis
Answer

7005

Question 4 :

A feasible region of a system of linear in equality is said to be bounded if it can be enclosed with in a

1. Triangle
2. polygon
3. circle
4. tow vertical lines
Answer
7006

Question 5 :

If a L.P.P admits optimal solution at two consecutive vertices of the feasible region, then

1.

The required optimal solution in at the midpoint of line joining these two points
2.

The optimal solution occurs at every point on the line joining these two points
3.

The L.P.P under consideration is not solution
4.

The L.P.P under consider must be reconstructed.
Answer

7007