solved the question, Operation Research

#questionthe 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/24/2013 6:58:05 AM | Location : USA







Related Discussions:- solved the question, Assignment Help, Ask Question on solved the question, Get Answer, Expert's Help, solved the question Discussions

Write discussion on solved the question
Your posts are moderated
Related Questions
Normal 0 false false false EN-IN X-NONE X-NONE

procedure of mip

#what is the similarity and difference between transportation and linear programing models?

Calculation of Ranks Correlation Where Ranks  are Given: When the  actual  ranks  are given  the steps  followed are: a.Compute  the difference  of the  two ranks  (R1 and

Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment

#quesQuestion. a paper mill produces two grades of paper viz.,xand y.Bacause of raw material restrictions, it cannot produce more than 400 tones of grade x paper and 300 tons of g


Inability of NIH, FDA, to Identify Conflict of Interest While federal regulations require that researchers receiving NIH grants remain free of financial conflicts of interest,

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we