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

Strategies and od intervention techniques, QUESTION 1 Change strategies...

QUESTION 1 Change strategies and OD intervention techniques follow from diagnosis. An inappropriate intervention due to a faulty diagnosis may be very costly to an organization

Scattered responsibility and authority, Scattered Responsibility and Autho...

Scattered Responsibility and Authority: In a big industry responsibility and authority of decisions making is scattered throughout the organization and thus the organization.

Decision trees, Ask questioA farmer intends to drill a well for his herd. I...

Ask questioA farmer intends to drill a well for his herd. In the past, only 80% of the wells drilled in this area were successful at 12 metres of depth. On finding no water at 12 m

Assignment, discuss about assignment and steps involved in it

discuss about assignment and steps involved in it

Mba , in a rectangular game pay off matrix of player a is as follows ...

in a rectangular game pay off matrix of player a is as follows B1 B2 A1 5 7 A2 4 0 salve the game write down the pay off matrix of B and then solve the ga

Tower of hanoi problem, Step 1: Research Towers of Hanoi problem The Tow...

Step 1: Research Towers of Hanoi problem The Towers of Hanoi is a problem frequently used to teach recursive programming techniques. Step 2: Run the assembly code from Hanoim

Assignment answer, Q2.Six Operators are to be assigned to five jobs with th...

Q2.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 assignm

LINEAR PROGRAMMING, SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=...

SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=3X1+2X2 SUBJECT TO CONSTRAINT X1+X2 X1-X2 X1,X2>=0

Why two regression lines - correlation regression analysis, Why Two regress...

Why Two regression Lines Once regression line  cannot  minimize the sum  of square of deviations  for both  the x and Y series  unless the relationship  between  them  indicat

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1.    Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X,  y ≥ 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