linear programmibg, Operation Research

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 A WEEK. THERE ARE 160 PRODUCTION HOURS IN A
WEEK. IT REQUIRES 0.20 AND 0.40 HOURS TO PRODUCE A TON OF GRADE X AND Y PAPERS.
THE MILL EARNS A PROFIT OF RS. 200 AND RS. 500 PER TON OF GRADE X AND Y PAPER
RESPECTIVELY. FORMULATE THIS AS A LINEAR PROGRAMMING PROBLEM.
Posted Date: 2/10/2013 5:17:47 AM | Location : USA







Related Discussions:- linear programmibg, Assignment Help, Ask Question on linear programmibg, Get Answer, Expert's Help, linear programmibg Discussions

Write discussion on linear programmibg
Your posts are moderated
Related Questions
Title  Page Tthe title page  should  indicate  the topic  on which  the report has been  prepared the  person  or agency who has  prepared it the  person  a agency for whom it

in a rectangular game ,pay of matrix of player A is as follows

Calculation of Ranks Correlation Where Ranks  are Given: When the  actual  ranks  are given  the steps  followed are: a.Compute  the difference  of the  two ranks  (R1 and

SING TEST The sign test  is the simplest  of the  parametric  tests. Its name comes  from the  fact  that it is based  on the direction ( or sings  for  pluses or minuses ) of

how to solve it

Construct a two-variable LP model that: · Maximizes Z; · All coefficients in the objective function are greater than 500; · Includes at least 5 constraints;

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 i

what happen if line balancing does not exist

#Principles of OR

#use the simple method to solve the following L.P.P. Maximize Z =4X1 +10X2 subject to constraints, 2X1 +X2 2X1+5X2 2X1 +3X2 X1,X2 > 0