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

Regression, Regression line drawn as Y=C+1075x, when x was 2, and y was 239...

Regression line drawn as Y=C+1075x, when x was 2, and y was 239, given that y intercept was 11. calculate the residual

Simplex method, how to use simples method

how to use simples method

Operation Research Models, Explain the classification of models 1. Classifi...

Explain the classification of models 1. Classification by function or uses 2. Classification by degree of qualification 3. Classification by physical characteristics 4. Classidicat

Solution transportation problem, asm-method

asm-method

Unit 8, undertake the proposed research investigation in accordance with th...

undertake the proposed research investigation in accordance with the agreed specification and procedures

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

Model., is model the essence of oprational research.

is model the essence of oprational research.

What do you mean by linear programming problem, Q1. a. What do you mean by ...

Q1. a. What do you mean by linear programming problem? Explain the steps involved in linear programming problem formulation? b. A paper mill produces two grades of paper viz., X

Deweys principle - information resources, Dewey's Principle: Melvil De...

Dewey's Principle: Melvil Dewey's principle states: "The best reading for the largest number at the least cost" According to this principle a library should select, within the

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1. Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X, y ≥ 0

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