Linear programming , Operation Research

Assignment Help:
#quesQuestion. a paper mill produces two grades of paper viz.,xand y.Bacause of raw material restrictions, it cannot produce more than 400 tones 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.25and 0.40 hours to produce a ton of grade z snf y psprtd. 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. tion..

Related Discussions:- Linear programming

Table of contents - report writing presentation, Table of contents ...

Table of contents The tables  of contents  is an outline  of the order  of the chapters sections and  sub  section  with their  respective  pages. If  report  includes  a n

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.

Game theory-, use of game theory by state bank of india

use of game theory by state bank of india

Operations research, six operators are to be assigned to the 5 jobs with th...

six operators are to be assigned to the 5 jobs with the cost of assignments

Answer, A paper mill products two grade of paper viz., X & Y. Because of ra...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

LPP, A paper mill prouduces two grads of paper viz., X and Y. Becouse of ra...

A paper mill prouduces two grads of paper viz., X and Y. Becouse of raw material restriction, it cannot product more then 400 tons of grade X paper and 300 tons of grade Y paper in

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

Sequensing problem, job- 1 2 3 4 5 6 7 t1- 3 12 15 6 10 11 9 t2- 8 10 10...

job- 1 2 3 4 5 6 7 t1- 3 12 15 6 10 11 9 t2- 8 10 10 6 12 1 3

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