linear programming problem, Operation Research

Assignment Help:

A paper mill produces two grades of paper viz., X and Y. Because of raw
each)
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

Answering questions for minimum spanning tree problems, Sample Assignment f...

Sample Assignment for minimum spanning tree problems For the subsequent graph get the minimum spanning tree. The numbers on the branches presents the cost.

Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 4 X...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 4 X1+ X2 2 X1, X2 0on..

Method of concurrent deviations, Method of Concurrent Deviations The ...

Method of Concurrent Deviations The coefficient of concurrent deviation or coefficient of correlation b the concurrent deviation methods is given by the formula. R

Two sample tests- hypothesis testing, Two Sample Tests In some situat...

Two Sample Tests In some situation the researchers may be taking statistical decisions based on two samples. Each of the two samples may represent a particular under con

Assignment, Six Operators are to be assigned to five jobs with the cost of ...

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 assignment

Differentiate among descriptive and inferential analysis o, Question 1 ...

Question 1 A) Differentiate among descriptive and inferential analysis of data B) Describe with examples various measures of Central Tendency Question 2 The chi-square

LPP using Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: ...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Simplex, Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4...

Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4x + 8y >= 5

Modi method, procedure of modi method

procedure of modi method

Categories, what are the operation research?

what are the operation research?

Write Your Message!

Name

Email id

Message

Verfication Code

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!

Submit Assignment

User Account

All Pages