Linear Programming Problem, 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 1.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 grade Y respectively. Formulate this as a linear programming problem.

Related Discussions:- Linear Programming Problem

Jaguar, how jaguar implements aggregate planning?

how jaguar implements aggregate planning?

Examine the future sustainability of business, In your role as a Consultant...

In your role as a Consultant to a renowned organisation or institution, you have been asked to design and submit a research proposal to examine the future sustainability of its bus

Survey method, This method involves a systematic and comprehensive study...

This method involves a systematic and comprehensive study of a particular community organization group etc, with a view to the analysis of a social problem and the presen

Preparation of visual aids , Preparation of visual Aids ,Handouts and Feedb...

Preparation of visual Aids ,Handouts and Feedback Forms It is always better to prepare visual aids much in advance of the presentation. Leaving them for the last mo

Linear programming model, Nass food produces to kinds of popular dark choco...

Nass food produces to kinds of popular dark chocolate bars. The banana and the coffee.the

Data collection-requirement gathering methods, Data Collection / Requiremen...

Data Collection / Requirement Gathering Methods 1. Discuss about the data collection or requirements gathering methods that will be used to conduct the research. 2. Discus

Chart the historical prices based on the monthly data, Choose a publicly tr...

Choose a publicly traded company (NYSE, AMX, or OTC) that interests you. If you don't know how to choose a company, think of IBM, DELL computer, Nike, Apple computer, GM, Ford, Nok

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

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

Annotated bibliography - report writing presentation , Annotated bibliograp...

Annotated bibliography In this bibliography each is followed by a one sentence or one paragraph description of the content of the work cited. For example Bndypad

MODI method, explain the procedure of MODI method of finding solution throu...

explain the procedure of MODI method of finding solution through optimaly test.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages