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

Modeling process, What are the basic 5 elements of modeling process

What are the basic 5 elements of modeling process

Duality, Write a note on economic interpretation of dual?

Write a note on economic interpretation of dual?

.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

Big M method, Maximize p = (3)x + 2y subject to 2x + y 3x + 4y >= 12

Maximize p = (3)x + 2y subject to 2x + y 3x + 4y >= 12

data analysis and research methodology , Case Study - Data Analysis ...

Case Study - Data Analysis Sandarsen inc was testing new packaging and a few recipe for a family desert cookie that had been on the market for several years. It wa

Ranganathan''s principles, Ranganathan's Principles: Perhaps it would ...

Ranganathan's Principles: Perhaps it would be worthwhile to consider the Five Laws of Library Science of Dr. S. R. Ranganathan as the basic guidelines for formulating the obje

Li, line drawn as Y=C+1075x, when x was 2, and y was 239, given that y inte...

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

Scope of operation research, scope of operation research in management

scope of operation research in management

Purchasing, need of detailed information about the topic

need of detailed information about the topic

Duality, maximum 3x1+x2+x3-x4 subject to x1+5x2+3x3+4x4 x1+x2=-1 x3+x4

maximum 3x1+x2+x3-x4 subject to x1+5x2+3x3+4x4 x1+x2=-1 x3+x4

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