linear programming, 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/12/2013 1:38:54 AM | Location : USA







Related Discussions:- linear programming, Assignment Help, Ask Question on linear programming, Get Answer, Expert's Help, linear programming Discussions

Write discussion on linear programming
Your posts are moderated
Related Questions
Festinger and Katz have described followings six steps in the conduct to a field study. a. Preliminary Planning :Deciding scope and objectives of study and the time table

INFORMATION RESOURCES: Information resources are of two kinds, namely, Documentary and Non-Documentary Sources. Documentary Sources: A document embodies thought. I

i need many good and important question of operation research obout dinamic programing and non-liner programing and integer orograming ....for study! thank you

Q. Explain Research Terminology? Research Terminology - Independent and Dependent variables: There are many practical problems in which the values of one variable depend upon t

Uses  of Mean  Deviation Mean  Deviation  is rarely being used as a measure of dispersion. But  due to  easy  and  simplicity  in calculation. It  is rather  useful  in busin

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

Small Sample The central limit  theorem does not work well  with small  samples  even if  the  population  in non Gaussian. So  we cannot  rely on the central limit theorem


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

Anthology or Book with Articles  or Works by Many Authors   The name  of the person  compiling the book  will be  given  followed  by the  word editor. For more  than one  edit