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

Operations Research, a. What do you mean by linear programming problem? Exp...

a. What do you mean by linear programming problem? Explain the steps involved in linear programming problem formulation? b. A paper mill produces two grades of paper viz., X and Y.

Liner programming problem, A constraints in an LPP restricts? (Value of obj...

A constraints in an LPP restricts? (Value of objective function,Value of decision variable,Use of available resources, uncertainty of optimum value) please help me to find out righ

Que, #queSix Operators are to be assigned to five jobs with the cost of ass...

#queSix 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 assign

LPP, USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJE...

USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJECT TO CONSTRAINS, 2X1+X2 2X1+5X2 2X1+3X2 X1, X2>0

Goal programming, Goal Programming This provides a more realistic model...

Goal Programming This provides a more realistic model. In a modern setting, profit maximization may not be the only objective of a business concern. Other objectives or goals c

Cost, Six Operators are to be assigned to five jobs with the cost of assign...

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

Purchasing power of customers, This is determined by disposable personal ...

This is determined by disposable personal income( personal income minus direct taxes and other deductions ). Some people suggest the use of discretionary income in place of

Linear programimg, Solve the following Linear Programming Problem using Si...

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

Solve by simplex method, Solve by simplex method Maximize Z = 5...

Solve by simplex method Maximize Z = 5x 1 + 3x 2 Subject to 3x 1 + 5x 2 ≤ 15 5x 1 + 2x 2 ≤ 10 &         x 1 ≥ 0, x 2  ≥ 0 [Ans. Max Z = 235/19

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