Dina, Operation Research

Construct a two-variable LP model that:

· Maximizes Z;
· All coefficients in the objective function are greater than 500;
· Includes at least 5 constraints;
· Each coefficient (in the main constraints) is either less that -50 or greater than 50.


Using the software TORA, solve the model using graphic method.

Hint: Use:
à Linear Programming
à Graphic
Posted Date: 3/12/2013 1:15:33 PM | Location : Jordan







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

Write discussion on Dina
Your posts are moderated
Related Questions
3. Explain ‘Vogel Approximation Model (VAM)’.? answer please

A paper mill produces two grades of paper viz., X & Y. Because of raw material restrictions, it cannot produce more 400 tons of grade X paper & 300 tons of grade Y paper in a week.

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 assignment

what are the classifications of operations research?

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

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

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Graphs of Time Series A time  series  is a sequence of values  corresponding  to successive points  of time. Time  series  are  graphed  with time  on the x axis  and the  oth

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 assignment

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