The document provides a tutorial on solving linear programming (LP) problems using the simplex method. It includes six example problems, each requiring maximization of a profit function subject to various constraints related to resources and production capabilities. The problems cover different scenarios, including agricultural crop allocation and product manufacturing with machine time constraints.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
7 views1 page
Simplex Tutorial WRS25
The document provides a tutorial on solving linear programming (LP) problems using the simplex method. It includes six example problems, each requiring maximization of a profit function subject to various constraints related to resources and production capabilities. The problems cover different scenarios, including agricultural crop allocation and product manufacturing with machine time constraints.
subject to x1 + x2 + x3 + x4 1 + 5x2 + 3x3 + 2x4 1 + 5x2 + 10x3 + 15x4 x1, x2, x3, x4 Q4. A farmer has 1,000 acres of land on which he can grow corn, wheat or soyabean. Each acre of corn costs Rs 100 for preparation, requires 7 men-days of work and yields a profit of Rs30. An acre of wheat costs Rs 120 to prepare, requires 10 men-days of work and yields a profit of Rs 40. An acre of soyabean costs Rs 70 to prepare, requires 8 men-days of work and yields a profit of Rs 20. If the farmer has Rs 1,00,000 for preparation and can count on 8,000 men-days of work, deter mine how many acres should be allocated to each crop in order to maximize profits? Q5. A company manufactures three products namely X, Y and Z. Each of the product require processing on three machines, Turning, Milling and Grinding. Product X requires 10 hours of turning, 5 hours of milling and 1 hour of grinding. Product Y requires 5 hours of turning, 10 hours of milling and 1 hour of grinding, and Product Z requires 2 hours of turning, 4 hours of milling and 2 hours of grinding. In the coming planning period, 2700 hours of turning, 2200 hours of milling and 500 hours of grinding are available. The profit contribution of X, Y and Z are Rs. 10, Rs.15 and Rs. 20 per unit respectively. Find the optimal product mix to maximize the profit. Q6. A company manufactures two products X and Y whose profit contributions are Rs. 10 and Rs. 20 respectively. Product X requires 5 hours on machine I, 3 hours on machine II and 2 hours on machine III. The requirement of product Y is 3 hours on machine I, 6 hours on machine II and 5 hours on machine III. The available capacities for the planning period for machines I, II and III are 30, 36 and 20 hours respectively. Find the optimal product mix.
Reshma Wishes To Mix Two Types of Food, P and Q, in Such A Way That The Vitamin Contents of The Mixture Contain at Least 8 Units of Vitamin A, and 11 Units of Vitamin B. Food P Costs Rs 60kg, and
Chapter - 3 Linear Programming - Problem Formulation and Graphical Method Problem Formulation 1. A Firm Makes Two Types of Furniture - Chairs and Tables. The Contribution For