linear programming problem, Operation Research

Assignment Help:

a paper mill prodecs 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 tib if grade X and Y paper respectively. Formulate this as a Linear Programming Problem.

Related Discussions:- linear programming problem

Find out where you should now invest your money, Question : Suppose tha...

Question : Suppose that you want to invest $10000 in the stock market by buying shares in one of two companies: A and B. Shares in Company A are risky but could yield a 50% ret

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

Simple method, solve the LPP using simple method, maximize z= 3x1+2x2 subje...

solve the LPP using simple method, maximize z= 3x1+2x2 subject to constraints

Books - report writing presentation , Books a. One author : Authors...

Books a. One author : Authors last name first name title of books place of publication: publisher copyright data page numbers used. b. Two Author : First author la

information on research done, Information on Research Done Informatio...

Information on Research Done Information on Doctoral research work already done is available from the followings sources: a. Bibliography of Doctoral Dissertations Acce

Linear programming problem, A paper mill produces two grades of paper viz.,...

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, main components of linear programming

main components of linear programming

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

Concept and need for information, CONCEPT AND NEED FOR INFORMATION: W...

CONCEPT AND NEED FOR INFORMATION: We shall look at the meaning, of information as also the meaning of other related words such as data, facts, intelligence, advice, knowledge

Game theory, #question:explain the theory of dominance in the solution of r...

#question:explain the theory of dominance in the solution of rectangular games?

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages