Linear Programming Problem

Mathematical Formulation of Linear programing problem(Example)

Food F_1 contains 5 units of vitamin A and 6 units of vitamin B per gram and costs 20 p/gm. Food F_2 contains 8 units of vitamin A and 10 units of vitamin B per gram and costs 30 p/gm. The daily requirements of A and B are at least 80 and 100 units respectively. Formulate the problem as a linear programming problem to minimize cost.

The corner point method for bounded feasible region comprises of the following steps I. When the feasible region is bounded, M and m are the maximum and minimum values of Z. II. Find the feasible region of the linear programming problem and determine its corner points. Ill. Evaluate the objective function Z = ax + by at each corner point. Let M and m respectively be the largest and smallest values of these points. The correct order of these above steps is

(Diet problem): A dietician wishes to mix two types of foods in such a way that vitamin contents of the mixture contain atleast 8 units of vitamin A and 10 units of vitamin C. Food "I" contains 2 units/kg of vitamin A and 1 unit/kg of vitamin C. Food "II" contains 1 unit/kg of vitamin A and 2 unite/kg of vitamin C. It costs Rs 50 per kg to purchase Food T and Rs 70 per kg to purchase Food "IF. Formulate this problem as a linear programming problem to minimise the cost of such a mixture.

A linear programming of linear functions deals with

Consider the following statements The term linear implies that all mathematical relations used in the problem are linear relations. II. The term programming refers to the method of determining a particular programme. Choose the correct option.

Linear Momentum Conservation Problems