Scribd Logo
Upload

Welcome to Scribd!

  • 469 views

    Assignment No 1 & 2

    Uploaded by

    maulik_244
    This document contains 7 linear programming problems involving minimizing costs or maximizing profits subject to various constraints. Problem 1 involves minimizing pollution reduction costs from 3 factories that emit 2 pollutants each into a river. Problem 2 involves minimizing the time Goldilocks spends in 2 mines to obtain at least 12 lbs of gold and 18 lbs of silver. Problem 3 involves minimizing the cost of producing 1000 cars across 4 plants subject to various material and labor constraints.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd

    Assignment No 1 & 2

    Uploaded by

    maulik_244
    469 views4 pages
    This document contains 7 linear programming problems involving minimizing costs or maximizing profits subject to various constraints. Problem 1 involves minimizing pollution reduction costs from 3 factories that emit 2 pollutants each into a river. Problem 2 involves minimizing the time Goldilocks spends in 2 mines to obtain at least 12 lbs of gold and 18 lbs of silver. Problem 3 involves minimizing the cost of producing 1000 cars across 4 plants subject to various material and labor constraints.

    Original Description:

    quont

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains 7 linear programming problems involving minimizing costs or maximizing profits subject to various constraints. Problem 1 involves minimizing pollution reduction costs from 3 factories that emit 2 pollutants each into a river. Problem 2 involves minimizing the time Goldilocks spends in 2 mines to obtain at least 12 lbs of gold and 18 lbs of silver. Problem 3 involves minimizing the cost of producing 1000 cars across 4 plants subject to various material and labor constraints.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    469 views4 pages

    Assignment No 1 & 2

    Uploaded by

    maulik_244
    This document contains 7 linear programming problems involving minimizing costs or maximizing profits subject to various constraints. Problem 1 involves minimizing pollution reduction costs from 3 factories that emit 2 pollutants each into a river. Problem 2 involves minimizing the time Goldilocks spends in 2 mines to obtain at least 12 lbs of gold and 18 lbs of silver. Problem 3 involves minimizing the cost of producing 1000 cars across 4 plants subject to various material and labor constraints.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    of 4

    Assignment No 1

    Formulate the following LPP 1. There are three factories on the Moniss River (1, 2, and 3). Each emits two types of pollutants (1 and 2) into the river. If the waste from each factory is processed, the pollution in the river can be reduced. It costs $15 to process a ton of factory 1 waste, and each ton processed reduces the amount of pollutant 1 by 0.10 ton and amount of pollutant 2 by 0.45 ton. It costs $10 to process a ton of factory 2 waste, and each ton processed will reduce the amount of pollutant 1 by 0.20 ton and the amount of pollutant 2 by 0.25 ton. It costs $20 to process a ton of factory 3 waste, and each ton processed will reduce the amount of pollutant 1 by 0.40 ton and the amount of pollutant 2 by 0.30 ton. The state wants to reduce the amount of pollutant 1 in the river by at least 30 tons and the amount of pollutant 2 in the river by at least 40 tons. Formulate and LP that will minimize the cost of reducing pollution by the desired amounts. 2. Goldilocks needs to find at least 12 lbs of gold and at least 18 lbs of silver to pay the monthly rent. There are two mines in which Goldilocks can find gold and silver. Each day that Goldilocks spends in mine 1, she finds 2 lbs of gold and 2 lbs of silver. Each day that Goldilocks spends in mine 2, she finds 1 lb of gold and 3 lbs of silver. Formulate an LP to help Goldilocks meet her requirements while spending as little time as possible in the mines. 3. Tucker Inc. must produce 1000 Tucker automobiles. The company has four production plants. The cost of producing a Tucker at each plant, along with the raw material and labour needed is shown in the table below. The autoworkers' labour union requires that at least 400 cars be produced at plant 3; 3300 hours of labour and 4000 units of raw material are available for allocation to the four plants. Formulate and LP whose solution will enable Tucker Inc. to minimize the cost of producing 1000 cars. Plant Cost (in '000 of Labour Raw material

    dollars) 1 2 3 4 15 10 9 7 2 3 4 5 3 4 5 6

    4. HAL produces two types of computers: PCs and VAXes. The computers are produced in two locations: New York and Los Angeles. New York can produce up to 800 computers and Los Angeles, up to 1000 computers. HAL can sell up to 900 PCs and 900 VAXes. The profit associated associated with each production site and computer sale is as follows: New York - PC, $600; VAX, $800; Los Angeles - PC, $1000; VAX, $1300. The skilled labour required to build each computer at each location is as follows: New York - PC, 2 hours; VAX, 2 hours; Los Angeles - PC, 3 hours; VAX, 4 hours. A total of 4000 hours of labour are available. Labour is purchased at a cost of $20 per hour. Formulate a LP to maximize the profit received by HAL. 5. A person requires 10, 12 and 12 units of chemicals A, B and C respectively for herbal garden. A liquid product contains 5, 2 and 1 units of A,B and C respectively per Jar. A dry product contains 1, 2 and 4 units of A, B and C per cartoon. If the liquid product sells for Rs. 3 per Jar and dry product sells for Rs. 2 per cartoon, how many of each should be purchased to minimise the cost and meet the requirements. 6. A diet is to contain at least 4000 units of carbohydrates, 500 units of fat and 300 units of protein. Two foods A and B are available. Food A costs 2 dollars per unit and food B costs 4 dollars per unit. A unit of food A contains 10 units of carbohydrates, 20 units of fat and 15 units of protein. A unit of food B contains 25 units of carbohydrates, 10 units of fat and 20 units of protein. Formulate the problem as an LPP so as to find the minimum cost for a diet that consists of a mixture of these two foods and also meets the minimum requirements. 7. In the production of 2 types of toys, a factory uses 3 machines A, B and C. The time required to produce the first type of toy is 6 hours, 8 hours

    and 12 hours in machines A, B and C respectively. The time required to make the second type of toy is 8 hours, 4 hours and 4 hours in machines A, B and C respectively. The maximum available time (in hours) for the machines A, B, C are 380, 300 and 404 respectively. The profit on the first type of toy is 5 dollars while that on the second type of toy is 3 dollars. Find the number of toys of each type that should be produced to get maximum profit.

    Assignment No. 2

    Solve the following graphically 1. Maximize: P = 150A + 200B Subject to 40A + 60B 7400 20A + 25B 3300 A,B 0 2. Minimise Z = 10x + 12y STC 3x + 5y 20 3x + y 16 2x + y 1 x,y 0 3. Max. Z = 5x + 7y STC x+y 4

    3x + 8y 24 10x + 7y 35 x,y 0 4. Min. Z = 5x + 4y STC x+y 2 x 8 y9 x,y 0 5. Max. Z = 3x + 2y STC x-y 1 x+y 3 4.5x + 3y 3 x,y 0

    You might also like