Answer, Operation Research

Assignment Help:
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 week. There are 160 production hours in week. It requires 0.20 & 0.40 hours to produce a ton of grade X & Y papers. The mill earns profits of Rs.200 & Rs.500 per ton of Grade X & Y paper respectively. Formulate this as a Linear Programming Problem.

Related Discussions:- Answer

Decision theory, the following table gives place under different states of ...

the following table gives place under different states of nature Strategies States of nature s1 s2 s3 A 10000 3000 2000 B

How to solve operation research optimization questions, how to solve operat...

how to solve operation research optimization questions

Summary report - report writing presentation, Summary  Report The  r...

Summary  Report The  report  format  suggested  above  does  not  contain  any  summary  section. This exclusion  is deliberate. The summary  should  not be  prepared until t

Operation research, Discuss the methodology of operation research

Discuss the methodology of operation research

Linear programing, Solve the following Linear Programming Problem using Sim...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2

Cgj, application&techniques

application&techniques

Reasearch on software design, Write a research paper in relation to a Softw...

Write a research paper in relation to a Software Design related topic. Diagrams and drawing of attention to key points through highlighting, bulleting etc is encouraged. Questi

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

Llp, 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

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