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/15/2013 6:05:46 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

Observation and Data Collection for Better Understanding of the Problem: Many times actual observations by trained observers at the scene of operation may be difficult and da

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

An electro-mechanical product for use in a vehicle has been in widespread use for some time and has proved popular with customers, in terms of its operational performance and price

Sample Size in Non Propbability The probability  selection does not apply  to purposive  selection. The size  of the  non  probability samples  is selected  in a subjective ma


Methods  of calculation of standard deviation a. Calculation of Standard  Deviation  - Individual Series: There  are two methods of calculating standard  deviation in an ind

a. What do you mean by linear programming problem? Explain the steps involved in linear programming problem formulation? b. A paper mill produces two grades of paper viz., X and Y.

Normal 0 false false false EN-IN X-NONE X-NONE

The Neatee Eatee Hamburger Joint specializes in soyabean burgers. Customers arrive according to the following inter - arrival times between 11.00 am and 2.00 pm: Interval-arrival