linear programming problem, 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:- linear programming problem

Frequency distribution graphs, Frequency  Distribution Graphs Freq...

Frequency  Distribution Graphs Frequency distribution graphs may be histogram frequency  polygon  frequency  curve  ogive curve.   1. Histogram The histogram is draw  f

Theoretical framework, Ask questiAvatars are virtual characters that can be...

Ask questiAvatars are virtual characters that can be used as representatives of a company that is using the Internet as a distribution channel. For instance, avatars can be used as

Queuing theory, A certain type of machine breaks down at an average rate of...

A certain type of machine breaks down at an average rate of 5/hour. the break down is in accordance with Poisson process.cost of idle machine hour is $15/hour. 2 repairmen Peter an

Production option and the ato process design, The plant is using the chase ...

The plant is using the chase production option and the ATO process design. The BOM is illustrated below.   Requirement The factory works on a process layout but

Determine phases-states-decisions and probability , G. Ambler has € 10000 ...

G. Ambler has € 10000 available for a second hand car, but would like to buy a fast car that costs € 25000. He needs the money for that car quickly, and would like to increase his

Linear programming, A PAPER MILL PRODUCES TWO GRADES OF PAPER VIZ., X AND Y...

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 I

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

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

Sampling techniques, discuss and explain both probability and non probabili...

discuss and explain both probability and non probability sampling techniques.

TRANSPORATION PROBLEM, sOLVE THE FOLLOWING D1 D2 D3 SUPPLY s1 2...

sOLVE THE FOLLOWING D1 D2 D3 SUPPLY s1 2 2 3 10 s2 4 1 2 15 s3 1 3 1 40 Demand 20 15 30

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