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

Calculate, A paper mill produces two grades of paper viz X and Y. Because o...

A paper mill produces two grades of paper viz X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper in

SIMPLEX METHOD, Solve the following Linear Programming Problem using simple...

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

Explain the process of problem identification with an exampl, Question ...

Question 1 Explain the process of problem identification with an example 2 Interview method involves a dialogue among the Interviewee and the Interviewer. Describe the inter

Optimum assignment, Six Operators are to be assigned to five jobs with the ...

Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment

#title. solution, Solve the following Linear Programming Problem using Simp...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2

Components of the product, The manufacturer of the product is finding that,...

The manufacturer of the product is finding that, in order to stay competitive, a number of things need to happen: Components of the product need to be made from more sustaina

Short question, write down any two assumption of L.P

write down any two assumption of L.P

Annotated bibliography - report writing presentation , Annotated bibliograp...

Annotated bibliography   In  this  bibliography each  is followed  by a one sentence or  one  paragraph  description of the content  of the work  cited. For  example Bndypad

Development of lp problems, A company manufactures 2 kinds of hats. Each ha...

A company manufactures 2 kinds of hats. Each hat of the I type needs twice as much as labour time as the II type. The company can manufacture a sum of 500 hats a day. The market re

Linear programming, maximize z=3x1+2*2 subject to the constraints x1+x2=4 x...

maximize z=3x1+2*2 subject to the constraints x1+x2=4 x1-x2=2 x1.x2=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