linear programming., Operation Research

Q3. 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/11/2013 10:57:49 PM | 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
Q2.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 assignm

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

what is operation research an management decision making

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

how i do project in linear programming

maximize z=3x1+2*2 subject to the constraints x1+x2=4 x1-x2=2 x1.x2=0

This method is more  systematic and orderly than least cost method. Here penalties for each column and row of the transportation table are determined, and the row  or  column with

Weaning  and Definition A systematic  arrangement of classified  data in labelled columns and  rows  is  known  a statistical table. Turtle has given  a comprehensive defin

maximum 3x1+x2+x3-x4 subject to x1+5x2+3x3+4x4 x1+x2=-1 x3+x4

McColvin's Principles: L.R McColvin advanced his Demand and Supply Theory of Book Selection in 1925. He states, "Books in themselves are nothing. They have no more meaning tha