solved a.q, Operation Research

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
Posted Date: 2/9/2013 2:29:06 AM | Location :







Related Discussions:- solved a.q, Assignment Help, Ask Question on solved a.q, Get Answer, Expert's Help, solved a.q Discussions

Write discussion on solved a.q
Your posts are moderated
Related Questions
Use of t -tables            Similar  to normal  curve  tables  there  exist t- distribution  tables. However  whereas the properties of  the normal  curve are constant for all

Chi Square  Test Goodness of Fit Chi square test  can be used to find out  how well the  theoretical distribution fit  with the  empirical distribution  of observed distribut

Example 2 Max Z = 3x 1 - x 2 Subject to             2x 1 + x 2 ≥ 2             x 1 + 3x 2 ≤ 3             x 2 ≤ 4     &     x 1 ≥ 0, x 2  ≥ 0   A

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

Meaning of Linear programming problem and explanation of graphical method of solving Linear Programming Problem

metholodolgy of operational research

#questionA 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 grad

Question 1 -Though society as well as culture do not appear to be a part of business situations, yet they are actually key elements in showing how business activities will be cond


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