--%>

Get Solved LP Problems

Solve Linear Programming Questions

A producer manufactures 3 models (I, II and III) of a particular product. He uses 2 raw materials A and B of which 4000 and 6000 units respectively are obtainable. The raw materials per unit of 3 models are listed below.

Raw materials

I

II

III

A

2

3

5

B

4

2

7

The labour time for each unit of model I is two times that of model II and thrice that of model III. The whole labour force of factory can manufacture an equivalent of 2500 units of model I. A model survey specifies that the minimum demand of 3 models is 500, 500 and 375 units correspondingly. However the ratio of number of units manufactured must be equal to 3:2:5. Suppose that gains per unit of model are 60, 40 and 100 correspondingly. Develop a LPP.

 

Answer

Assume

x1 - number of units of model I

     x2 - number of units of model II

     x3 - number of units of model III

 

 

 Raw materials

I

II

III

Availability

A

2

3

5

4000

B

4

2

7

6000

Profit

60

40

100

 

 

x1 + 1/2x2 + 1/3x3 ≤ 2500                                                       Labour time

 

x1 ≥ 500, x2 ≥ 500, x3 ≥ 375                                                    Minimum demand

 

The given ratio is x1: x2: x3 = 3: 2: 5

x1 / 3 = x2 / 2 = x3 / 5 = k

x1 = 3k; x2 = 2k; x3 = 5k

x2 = 2k → k = x2 / 2

So x1 = 3 x2 / 2 → 2x1 = 3x2

Likewise 2x3 = 5x2

 

Maximize Z= 60x1 + 40x2 + 100x3

Subject to 2x1 + 3x2 + 5x3 ≤ 4000

                  4x1 + 2x2 + 7x3 ≤ 6000

x1 + 1/2x2 + 1/3x3 ≤ 2500

2 x1 = 3x2

2 x3 = 5x2

& x1 ≥ 500, x2 ≥ 500, x3 ≥ 375

 

   Related Questions in Basic Statistics

  • Q : Get Solved LP Problems Solve Linear

    Solve Linear Programming Questions A producer manufactures 3 models (I, II and III) of a particular product. He uses 2 raw materials A and B of which 4000 and 6000 units respectively are obtainable. The raw materials per unit of 3

  • Q : Networks of queues Networks of queues •

    Networks of queues • Typically, the flow of customers/request through a system may involve a number of different processing nodes.– IP packets through a computer network– Orders through a manufactur

  • Q : Sample Questions in Graphical Solution

    Solved problems in Graphical Solution Procedure, sample assignments and homework Questions: Minimize Z = 10x1 + 4x2 Subject to

  • Q : Compare the test results The grade

    The grade point averages of 61 students who completed a college course in financial accounting have a standard deviation of .790. The grade point averages of 17 students who dropped out of the same course have a standard deviation of .940. Do the data indicate a

  • Q : Define Operational Analysis

    Operational Analysis: • Analysis method based on the measurement of the operational characteristics of the system.

    Q : Define SPIN simulation modes SPIN: •

    SPIN: • SPIN generates C program that is the model checker – The pan verifier • Process Analyzer – Run the pan executable to do the model check

  • Q : Define Service Demand Law

    Service Demand Law:• Dk = SKVK, Average time spent by a typical request obtaining service from resource k• DK = (ρk/X

  • Q : Help An experiment is conducted in

    An experiment is conducted in which 60 participants each fill out a personality test, but not according to the way they see themselves. Instead, 20 are randomly assigned to fill it out according to the way they think a parent sees them (i.e. how a parent would fill it out to describe the participant

  • Q : Program Evaluation and Review

    Program Evaluation and Review Technique (PERT) A) Developed by US Navy and a consulting firm in 1958 for the Polaris submarine project. B) Technique as for CPM method, but acti

  • Q : Use the NW corner rule to find an

      (a) Use the NW corner rule to find an initial BFS, then solve using the transportation simplex method. Indicate your optimal objective function value. (b) Suppose we increase s1 from 15 to 16, and d3 from 10 to 11. S