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

Multi stage sampling - sampling decisions, Normal 0 false fal...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Steps of research proposal, Steps of Research Proposal Proposal Con...

Steps of Research Proposal Proposal Content The researcher is always given instructions for preparing a proposal that indicate the format to be followed. Funding agencie

Conflicts of interest and related change in medical research, Conflicts of ...

Conflicts of Interest and Related Change in Medical Research The significant increase in private industry drug studies has spawned three other changes in medical research: med

Linear programming solution by steps for two-phase method, Solve by Steps f...

Solve by Steps for Two-Phase Method Max Z = 5x 1 + 8x 2 Subject to 3x 1 + 2x 2 ≥ 3 x 1 + 4x 2 ≥ 4 x 1 + x 2 ≤ 5 & x 1 ≥ 0, x 2 ≥ 0 Answe

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

Z-test - hypothesis testing, Z-Test Prof. Fisher has given a method of...

Z-Test Prof. Fisher has given a method of testing the significance of the correlation coefficient in small samples. According to this method the coefficient of correlation

OR TECHNIQUES, EXPLAIN THE OR TECHNIQUES

EXPLAIN THE OR TECHNIQUES

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1. Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X, y ≥ 0

WEITING MODEL(QUEUING), CONSIDER A BARBER SHOP WITH ONE CHAIR, ONE BARBER A...

CONSIDER A BARBER SHOP WITH ONE CHAIR, ONE BARBER AND NO ROOM FOR CUSTOMER TO WAIT. IF THE CHAIR IS EMPTY WHEN THE CUSTOMER ARRIVES,HE ENTER THE SHOP AND HIS HAIR CUT BEGINS. IF TH

Simple line graphs , Simple Line Graphs a. Simple Histogram A simpl...

Simple Line Graphs a. Simple Histogram A simple histogram is a techniques used plotting a time series on the graph paper. The data are arranged according to the time

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages