linear programmimg, Operation Research

Assignment Help:
#questionA 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 programmimg

Trade literature - classification of documents, Trade Literature: Trad...

Trade Literature: Trade literature consists of documents that give information on the processes and materials involved in the manufacture of a product, various types of produc

Frequency distribution graphs, Frequency  Distribution Graphs Freq...

Frequency  Distribution Graphs Frequency distribution graphs may be histogram frequency  polygon  frequency  curve  ogive curve.   1. Histogram The histogram is draw  f

One tailed and two tailed tests -hypothesis testing , Normal 0 ...

Normal 0 false false false EN-IN X-NONE X-NONE

Analyse the average number and mean number, Consider the closed network of ...

Consider the closed network of the following figure. The number at the arrows give the transition probabilities for a customer leaving the queue to route to a subsequent queue. Eve

Operations research approach to problem solving, Formulation of the Problem...

Formulation of the Problem: Before proceeding to find the solution of a problem, first of all a manager should be competent enough to form an appropriate model. To do so f

North west corner rule, North West Corner Rule for Initial Solution: Now ...

North West Corner Rule for Initial Solution: Now by applying North West corner rule we can initial solution. According to this rule without regard to cost consideration the

LPP, Solve the following Linear Programming Problem using Simple method. Ma...

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

Maths, Maxz=3x1-2x2 St x1-x2 >_0, 3x1-x2 _0

Maxz=3x1-2x2 St x1-x2 >_0, 3x1-x2 _0

Scope and concept, Explian scope and concept of Operations research?

Explian scope and concept of Operations research?

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