linear programming problem, Operation Research

Assignment Help:
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.

Related Discussions:- linear programming problem

Techniques of observation method, Techniques of Observation Method Obs...

Techniques of Observation Method Observation always involves some interaction between respondent and researcher in which researcher has an opportunity to watch respondent fu

Hypothesis building and testing, Hypothesis  Building and Testing The...

Hypothesis  Building and Testing The foundation of hypothesis building  lies in discovering links between  elements  of your data. CAQDAS can help you to  discover these links

Sample linear programming problems to calculate max profit, The following l...

The following linear programming is written to plan the production of two products. And the company wants to maximize profits. x1 = number of product 1 produced in each batch

Both LP and PIP, marginal rate of substitution, degeneracy and degenerate ...

marginal rate of substitution, degeneracy and degenerate solution

Waiting queques, During busy times, 60 potential customers per hour arrive ...

During busy times, 60 potential customers per hour arrive at the booth (assume a Poisson distribution). A booth worker takes 5 minutes, on average, to meet the information needs of

Lpp, Determine feasible space for x1-x2= 8

Determine feasible space for x1-x2= 8

Fromulation of LPP, A paper mill produces two grades of paper viz., X and ...

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 ot grade Y paper in

Mip, procedure of mip

procedure of mip

Linear programing, Maximize6x1+8x2+5x3,st,labour3x1+4x2+5x3 =0 then brefly ...

Maximize6x1+8x2+5x3,st,labour3x1+4x2+5x3 =0 then brefly explain x1,x2,x3;term labour,metal&plastic;the160hours;x1,x2&x3>=0

.sequencing problem, which job should proceed first among the 2 jobs on n ...

which job should proceed first among the 2 jobs on n machines by graphical method

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