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

Linear programimg, Solve the following Linear Programming Problem using Si...

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

Techniques, explain the different techniques as operation research

explain the different techniques as operation research

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

Evaluate a product from the view point of quality, This assignment requires...

This assignment requires you to evaluate a product from the view point of quality, both quality of design (as perceived by the user) and quality of conformance. To ensure that we a

form of t- distribution - hypothesis testing , Form of t- Distribution ...

Form of t- Distribution 1. The students  t - distribution  like the  normal  distribution has bell shaped frequency  curve which is symmetrical. The only  parameter which  det

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

Some guidelines for bibliography entries , Some Guidelines  for Bibliograp...

Some Guidelines  for Bibliography Entries 1. Reference of a Back  by One Authors : Mention authors  name book title ( in italics hence  to be  underlined) city  publication

Linear programming, solve the following linear programming problem using si...

solve the following linear programming problem using simplex method maximize z=3x1+2x2 subject to the constraints: x1+x2 x1+x2 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