Linear Programm...

In a LPP, the objective function is always

Maximize Z = –x + 2y, subject to the constraints: x ≥3, x + y ≥5, x + 2y ≥6, y ≥0.

Two godowns A and B have grain capacity of 100 quintals and 50 quintals respectively. They supply to 3 ration shops, D, E and F whose requirements are 60, 50 and 40 quintals respectively. The cost of transportation per quintal from the godowns to the shops are given in the following table:

How should the supplies be transported in order that the transportation cost is minimum? What is the minimum cost?

Corner points of the feasible region for an LPP are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let F = 4x + 6y be the objective function. Maximum of F –Minimum of F =

A linear programming problem is one that is concerned with

Which of the following types of problems cannot be solved by linear programming methods

The optimal value of the objective function Z = ax + by may or may not exist, if the feasible region for a LPP is

One kind of cake requires 200g of flour and 25g of fat, and another kind of cake requires 100g of flour and 50g of fat. Find the maximum number of cakes which can be made from 5kg of flour and 1 kg of fat assuming that there is no shortage of the other ingredients used in making the cakes.

An oil company has two depots A and B with capacities of 7000 L and 4000 L respectively. The company is to supply oil to three petrol pumps, D, E and F whose requirements are 4500L, 3000L and 3500L respectively. The distances (in km) between the depots and the petrol pumps is given in the following table:

Assuming that the transportation cost of 10 litres of oil is Re 1 per km, how should the delivery be scheduled in order that the transportation cost is minimum?What is the minimum cost?

Corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let Z = px+qy, where p, q >0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) is