Scribd
Upload
112 views5 pages

Ge4 Linear Programming

Linear programming is a method for determining the optimal solution to problems with linear constraints and objectives. It involves setting decision variables, constraints, data, and an objective function to calculate the best value under certain conditions. Some key advantages of linear programming are that it provides insights into business problems, helps solve multi-dimensional issues, and allows for adjustments based on changing conditions by calculating costs and profits to determine the best solution.

Uploaded by

krizza angela balleta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
112 views5 pages

Ge4 Linear Programming

Linear programming is a method for determining the optimal solution to problems with linear constraints and objectives. It involves setting decision variables, constraints, data, and an objective function to calculate the best value under certain conditions. Some key advantages of linear programming are that it provides insights into business problems, helps solve multi-dimensional issues, and allows for adjustments based on changing conditions by calculating costs and profits to determine the best solution.

Uploaded by

krizza angela balleta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

LINEAR PROGRAMMING

SOLVE THE FOLLOWING LINEAR PROBLEMS


1. Solution:
Let the mixture contains x kg of food `I` and y kg of Food `II`.

Resources Food I Food II Requirements


(x) (y)
Vitamins A (units/kg) 2 1 8
Vitamins C (units/kg) 1 2 10
Cost (Rs/kg) 50 70

For vitamin A-
Food I contain 2 unit and food II contains 1 units and total unit is at least 8.
 2 x+ y ≥ 8

For Vitamin C-
Food I contain 1 unit and food II contains 2 units and total unit is at least 10.
 x +2 y ≥ 10

Also cost of food I is 50 and cost of food II is 70 per kg

Total cost is 50x+70y

 z=5 x +7 y

Subject to the constraints:


2 x+ y ≥ 8
x +2 y ≥ 10
and x , y ≥ 0
Corner points z=5 x +7 y
(0,8) 560
(2,4) 380 – minimum
(10,0) 500

At (0,8) Z=0+70(8) = 560


At (2,4) ⇒ Z=50(2) + 70(4) = 100+280=380(min)
At (10,0) ⇒ Z=50(10) + 0 = 500
Optimal solution is x=2, y=4 and minimum Z=380

Hence Minimum cost is 380 (Rs.380). and mixture has 2 kg of food I and
4kg of food II.
2. Solution:

Let number of first kind of cake is X and another kind of cake is Y.

Kind of Cake No. of Cakes Flour Fat


1st x 200g 25g
2nd y 100g 50g
Total x+y 5kg = 5000g 1kg = 1000g

Flour Fat

Food 1st contains 200g Food 1st contains 25g

Food 2nd contains 100g Food 2nd contains 50g

Maximum qtty. Available Maximum qtty. Available

is equal to 5kg or 5000g is equal to 1kg or 1000g

therefore, 200x + 100y ≤ 5000 therefore, 25x + 50y ≤ 1000


2 x+ y ≤ 50 x +2 y ≤ 40

Also , x ≥ 0 , y ≥0

As we need to maximize the number of cakes. Hence the function used


maximum Z.

Since Total no. of cakes = x + y

Maximize Z = x + y

Subject to the constraints:


2 x+ y ≤ 50
x +2 y ≤ 40
x ≥ 0 , y ≥0
Corner points z=x + y
(25,0) 25
(20,10) 30 – maximum
(0,20) 20

Maximum number cakes = 30


Therefore, number of cakes will be maximum when number of cakes 1st
kind are 20 and number of cakes 2nd kind are 10.
LINEAR PROGRAMMING

ENUMERATION

1. Linear programming is the method of considering different inequalities


relevant to a situation and calculating the best value that is required to
be obtained in those conditions.

2. Types of Linear Programming


 Solving linear programming by Simplex method
 Solving linear programming using R
 Solving linear programming by graphical method
 Solving linear programming with the use of an open solver

3. Basic requirements of Linear Programming


 Decision Variables
 Constraints
 Data
 Objective Functions

4. Advantages of Linear Programming


 Linear programming provides insights into business problems.
 It helps to solve multi-dimensional problems.
 According to change of the conditions, linear programming helps
us in adjustments.
 By calculating the profit and cost of different things, Linear
programming also helps to take the best solution.

5. Linear Programming Problems (LPP) is a problem that is concerned with


finding the optimal value of the given linear function.

You might also like