or, 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:- or

Complexity - necessity of operations research, In a big industry the numbe...

In a big industry the numbers of factors influencing a decision have increased situation has become big and complex because these factors interact with each other in complica

Determine the best age at which to replace the machine, Question: Machi...

Question: Machine A costs Rs. 9000. Annual operating costs are Rs. 200 for the first year, and then increase by Rs. 2000 every year. Suppose that the machine has no resale valu

Operations research 2, management wants to know how many supervisors should...

management wants to know how many supervisors should be hired, and what could be the optimum workload distribution to be applied, given a number of constraints

MODERN MANAGEMENT, DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH...

DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH IN MODERN MANAGEMENT

Periodicals and serials - classification of documents, Periodicals and Seri...

Periodicals and Serials: Periodical publications form an important part of today's information world. It is one of the oft chosen forms of research communication. There are ov

Simplex method, how to solve simplex method in LPP?

how to solve simplex method in LPP?

Answering questions for minimum spanning tree problems, Sample Assignment f...

Sample Assignment for minimum spanning tree problems For the subsequent graph get the minimum spanning tree. The numbers on the branches presents the cost.

Solve the following Linear Programming Problem using Simple , Solve the fol...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2

Scope, With practical example

With practical example

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