0% found this document useful (0 votes)
110 views3 pages

Assignment 2

The document contains multiple linear programming problems involving maximizing or minimizing objectives subject to constraints. The problems involve manufacturing different products to maximize profit, investing money to maximize interest, and allocating resources to maximize production while satisfying demand and capacity constraints.

Uploaded by

siyalohia8
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
0% found this document useful (0 votes)
110 views3 pages

Assignment 2

The document contains multiple linear programming problems involving maximizing or minimizing objectives subject to constraints. The problems involve manufacturing different products to maximize profit, investing money to maximize interest, and allocating resources to maximize production while satisfying demand and capacity constraints.

Uploaded by

siyalohia8
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/ 3

Assignment

1.

2. A manufacturer of wooden articles produces tables and chairs which requires


two types of inputs mainly, they being wood and labour. The manufacturer
knows that for a table 3 units of wood and 1 unit of labour are required while
for a chair they are 2 units each. The profit from each table is Rs. 50 while it is
Rs. 20 for each chair. The total available resources for the manufacturer are
150 units’ wood and 75 units of labour. The manufacturer wants to maximize
his profit by distributing his resources for tables and chairs. Formulate the
problem mathematically
3. A manufacturer produces nuts and bolts. It takes 1 hour of work on machine A
and 3 hours on machine B to produce a package of nuts. It takes 3 hours on
machine A and 1 hour on machine B to produce a package of bolts. He earns a
profit of Rs 17.50 per package on nuts and Rs 7.00 per package on bolts. How
many packages of each should be produced each day so as to maximise his
profit, if he operates his machines for at the most 12 hours a day?
4. Minimize and maximize Z = 5x + 10y subject to constraints are x + 2y ≤ 120, x +
y ≥ 60, x - 2y ≥ 0 and x, y ≥ 0.
5. Maximise and minimise Z = 3x - 4y, subject to
x−2y≤0
−3x+y≤4
x−y≤6
x,y≥0

6.Differentiate between feasible and infeasible solutions of LPP.

7. Write all steps of graphical method for solution of linear programming


problem.
8. Explain Manufacturing Problem of LPP with an example,

9.

10. Rahul wants to invest at most Rs 12,000 in bonds A and B. According to the
rules he has to invest at least Rs 2000 in bond A and at least Rs 4000 in bond B. If
the rate of interest on bond A is 7% per annum and on bond B, it is 8% per annum,
how should be invest the money for maximum interest

11. A toy company manufactures two types of dolls, A and B. Market research and
available resources have indicated that the combined production level should not
exceed 1200 dolls per week, and the demand for dolls of type B is at most half of
that for dolls of type A. Further, the production level of dolls of type A can exceed
three times the production of dolls of other type by at most 600 units. If the company
makes profit of Rs 12 and Rs 16 per doll, respectively, on dolls A and B, how many
of each should be produced weekly in order to maximise the profit?.

12. a)State the Definition of optimization with example.

b)Differentiate between bounded and unbounded regions with example

13. Two tailors X and Y earn Rs 100 and Rs 300 per day respectively. A can stitch 6
shirts and 4 pants per day while B can stich 10 shirts and 4 Pants per day. How many
days each work if it is desired to produce at least 60 shirts and 32 pants at a
minimum labour cast?

14. Minimize and maximize Z=x+2y subject to constraints


are x+2y≥100,2x−y≥0,2x+y≤200 and x,y≥0.

You might also like