Lpp linear programming problems exercise, Operation Research

Assignment Help:

Exercise

  1. Define the terms used in LPP.
  2. Mention the advantages of LPP.
  3. What are the assumptions and limitations of LPP?
  4. A firm produces three products. These products are processed on three different machines. The time required manufacturing one unit of each of the three products and the daily capacity of the three machines are given in the table.

Machine

Time per unit (mins)

Machine capacity

Min /day

Product 1

Product 2

Product 3

M1

2

3

2

440

M2

4

-

3

470

M3

2

5

-

430

 

It is required to determine the daily number of units to be manufactured for each product. The profit per unit for product 1, 2 and 3 is Rs. 4, Rs. 3 and Rs. 6 respectively. It is assumed that all the amounts produced are consumed in the market. Formulate the mathematical model for the model.

 

  1. A chemical firm produces automobiles cleaner X and polisher Y and realizes Rs. 10 profit on each batch of X and Rs. 30 on Y. Both products require processing through the same machines, A and B but X requires 4 hours in A and 8 hours in B, whereas Y requires 6 hours in A and 4 hours in B. during the fourth coming week machines A and B have 12 and 16 hours of available capacity, respectively. Assuming that demand exists for both products, how many batches of each should be produce to realize the optimal profit Z?

 

  1. A firm manufactures headache pills in two sizes A and B. Size A contains 2 grains of aspirin, 5 grains of bicarbonate and 1 grain of codeine. Size B contains 1 grain of aspirin, 8 grains of bicarbonate and 6 grains of codeine. It is formed by users that it requires at least 12 grains of aspirin, 74 grains of bicarbonate and 24 grains of codeine fro providing immediate effect. It is required to determine the least number of pills a patient should take to get immediate relief. Formulate the problem as a standard LPP.

 

 


Related Discussions:- Lpp linear programming problems exercise

Linear programming, solve the following linear programming problem using si...

solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 x1,x2>=0

Rank methods spearman s, Rank Methods Spearman s When the variables  u...

Rank Methods Spearman s When the variables  under  consideration are  not capable  of quantitative  measurement but can  be arranged  in serial  order( ranks) we find  correla

Solve the following Linear Programming Problem using Simple , Solve the fol...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2

Policies, POLICIES, NORMS AND STANDARDS: Information source; building,...

POLICIES, NORMS AND STANDARDS: Information source; building, an important function of the library, should be based on sound policies and programmes.  The basic question of

Transportation and assignment problem, What are the computer applications o...

What are the computer applications of transportation and assignment problem

Scope., what is the scope of operational research in india ? explain with t...

what is the scope of operational research in india ? explain with the job names.

Modi Method, a manufacture wants to ship 8 loads of his product as shown be...

a manufacture wants to ship 8 loads of his product as shown below. The matrix gives the mileage from origin to the destination D.

Linear programming, mile-high microbrewery makes a light beer and a dark be...

mile-high microbrewery makes a light beer and a dark beer. mile-high has a limited supply of barley, limited bottling capacity, and a limited market for light beer. profits are $0.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd