Scribd
Upload
7 views1 page

Linear Programming Problems in Operations Research

The document presents several linear programming problems related to production optimization in different manufacturing scenarios. It includes a case study of a manufacturing company producing products A, B, and C, a dietary supplement company, and a leather belt manufacturer, each requiring formulation of LP models to maximize profit or minimize costs. Additionally, it outlines constraints and objectives for graphical method solutions to LP problems.

Uploaded by

Mohan Pushparaj
Copyright
© All Rights Reserved
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
7 views1 page

Linear Programming Problems in Operations Research

The document presents several linear programming problems related to production optimization in different manufacturing scenarios. It includes a case study of a manufacturing company producing products A, B, and C, a dietary supplement company, and a leather belt manufacturer, each requiring formulation of LP models to maximize profit or minimize costs. Additionally, it outlines constraints and objectives for graphical method solutions to LP problems.

Uploaded by

Mohan Pushparaj
Copyright
© All Rights Reserved
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

Coimbatore Institute of Technology

Department of Mechanical Engineering


19ME55 Operations Research B.E. Mechanical Engineering V – Sem (Sec I & II) Tutorial - I
1. A manufacturing company is engaged in producing three types of products; A, B and C. the production
department produces, each day, components sufficient to make 50 units of A, 25 units of B and 30 units
of C. The management is confronted with the problem of optimizing the daily production of the products
in the assembly department, where only 100 man-hours are available daily for assembling the products.
The following additional information is available:
Profit Contribution
Assembly Time
Type of Product per Unit of Product
per Product (hrs)
(Rs.)
A 12 0.8
B 20 1.7
C 45 2.5
The company has a daily order commitment for 20 units of product A and a total of 15 units of
products B and C. Formulate this problem as an Linear Programming model so as to maximize the total
profit.
2. ABC Foods Company is developing a low-calorie high-protein diet supplement called Hi-Pro. The
specifications of Hi-Pro have been established by a panel of medical experts. These specifications along
with the calorie, protein and vitamin content of three basic foods, are given in the following table;
Nutritional Units of Nutritional Elements ( Per 100 grams of Basic Foods Hi-
Elements serving of Basic foods) pro
Specifications
Calories 350 250 200 300
Proteins 250 300 150 200
Vitamin A 100 150 75 100
Cost per serving 1.5 2.00 1.20
(Rs)
What quantities of foods 1, 2 and 3 should be used? Formulate this problem as LP models minimize
cost of serving.

3. Use the graphical method to solve the following LP problem.


Maximize Z = 2X1 + X2
Subject to the constraints
X1 + 2X2 ≤ 10
X1 + X2 ≤6
X1 - X2 ≤2
X1 - 2X2 ≤1
X1, X2 ≥ 0
4. Use the graphical method to solve the following LP problem.
Minimize Z = 3X1 + 2X2
Subject to the constraints
5X1 + 2X2 ≥ 10
X1 + X2 ≥6
X1 + 4X2 ≥ 12
X1, X2 ≥ 0
5. A manufacturer of leather belts makes three types of belts A, B and C which are processed on three
machines M1, M2 and M3. Belt A requires 2 hours on machine M1, 3 hours on machine M2 and 2 hours
on M3. Belt B requires 3 hours on machine M1, 2 hours on machine M2 and 2 hours on M3. Belt C
requires 5 hours on machine M2, 4 hours on machine M3. There are 8 hours of time per day available on
machine M1, 10 hours of time per day available on 15 hours of time per day available on machine M3.
The profit gained from belt A is Rs3.00 per unit, from Belt B is Rs.5.00 per unit, from belt C is Rs. 4 per
unit. What should be the daily production of each type of belt so that the products yield the maximum
profit?

You might also like