simplex method, Operation Research

Solve the following Linear Programming Problem using Simplex method.
Maximize Z= 3x1 + 2X2
Subject to the constraints:
X1+ X2 = 4
X1 - X2 = 2
X1, X2 = 0
Posted Date: 2/23/2013 10:31:12 AM | Location : USA







Related Discussions:- simplex method, Assignment Help, Ask Question on simplex method, Get Answer, Expert's Help, simplex method Discussions

Write discussion on simplex method
Your posts are moderated
Related Questions

A company uses 4 pounds of resource 1 to make each unit of X1 and 3 pounds of resource 1 to make each unit of X2. There are only 150 pounds of resource 1 available. Which of the fo

Graphical Solution Procedure sample assignment and solved questions, free examples and solved homework samples for Graphical Solution Procedure in operation research. Question

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


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


I''m getting a negative value in the one of the Supply/Stock columns while solving a problem in Vogel''s approximation method. Is it possible or am I doing anything wrong?

explanation

Discuss the methodology of operation research