linear programming problem, Operation Research

Assignment Help:

a paper mill prodecs 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 tib if grade X and Y paper respectively. Formulate this as a Linear Programming Problem.

Related Discussions:- linear programming problem

Macroeconomic environment in which the business operates, Provide a descrip...

Provide a description of the macroeconomic environment in which the business operates noting: a) The overall 'stability' of the political system/government of the country in whi

PERT, how does it work

how does it work

Explain the history of boots and shoes, Question 1 Explain any five access...

Question 1 Explain any five accessory industries Question 2 Explain the history of boots and shoes Question 3 Write short notes on following- Types of Gujarati emb

SIGNIFICANCE OF OPERATION RESEARCH, WHAT ARE THE SIGNIFICANCE OF OPERATION ...

WHAT ARE THE SIGNIFICANCE OF OPERATION RESEARCH

Scattered responsibility and authority, Scattered Responsibility and Autho...

Scattered Responsibility and Authority: In a big industry responsibility and authority of decisions making is scattered throughout the organization and thus the organization.

What do you understand by the term operations research, Question : (a) ...

Question : (a) (i) What do you understand by the term "operations research"? (ii) Discuss three common operations research models. (b) Self-service at the university c

Answer, A paper mill products two grade of paper viz., X & Y. Because of ra...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Linear programming, maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-...

maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-x2 x1,x2>_0

Problems, can u send me some assigment problems

can u send me some assigment problems

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

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