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
A water chillier with a capacity of 30 TR cools 20 m 3 /hr. water entering at 12 o C what is the temp. of water leaving the chillier. A reversible engine has an ideal thermal ef

A company manufactures 2 kinds of hats. Each hat of the I type needs twice as much as labour time as the II type. The company can manufacture a sum of 500 hats a day. The market re

there are 5 plants located in different cities and manufacturer a common produt A

1) Provide an overall description of the business and the competitive environment in which it operates.  You should describe: a) what type of business it  is (e.g. retail, manuf

Answering Question to Finding Shortest Path - Operation Research Assignment Help Finding answers for shortest path problems are quite interesting and not easy to solve. In solv

The following equation gives Jane's linear demand curve for visits to a nearby national park.  Q is the number of visits per week and P represents the price of a pass (price per vi

C++ code for assignment problem

NARROWING THE RESEARCH PROBLEM You have read how from a general topic we have arrived at the definition of the problem to be studied. Now we have to narrow it down furthe

A DRUG MANUFACTURER produces 2 products X1 and X2.X1 needs 2 hours on machine A AND 2 HOURS ON MACHINE B.X2 needs 3 hours on machine A and 1 hour on machine B.If machine A can run