Problems based on lpp when feasible region is unbounded, Operation Research

Assignment Help:

Problems based on LPP when feasible region is unbounded.

1. Minimize z = 3x + 5y subject to constraints

X + y ≥ 2

X + 3y ≥ 3

X, y ≥ 0

script

solution

1. Let z = 3x + 5y

2. Let us Draw the line x + y = 6 and x + 3y = 3 using suitable points on the graph.

3.These lines intersect at

4. Now shade the region of intersection of these lines

5.Vertices of shaded feasible region are

Now,

At C(3,0)

At P(3\2,1\2)

At B(0,2)

Therefore at P(3\2,1\2), z=3x+5y is minimum

P(3\2,1\2)

(3,0) P(3\2,1\2) and B(0,2)

Z= 3x + 5y

Z= 9

Z= 7

Z= 10

Related Discussions:- Problems based on lpp when feasible region is unbounded

Optimization , A company uses 4 pounds of resource 1 to make each unit of X...

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

Techniques of operations research, There is no unique set of problems which...

There is no unique set of problems which can be solved by using operations Research Models r techniques. Several operations Research Models or techniques can be grouped into some b

Method of calculation of mode - measure of central tendency , Method of cal...

Method of calculation of Mode Calculation of Mode Individual series: For determining mode count the number of times the various values repeat themselves and the va

LPP, A paper mill produces two grades of paper viz., X and Y. Because of ra...

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

Production and operations management., layout of any retailer shop and the ...

layout of any retailer shop and the reasons for the layout

Linear programming, mile-high microbrewery makes a light beer and a dark be...

mile-high microbrewery makes a light beer and a dark beer. mile-high has a limited supply of barley, limited bottling capacity, and a limited market for light beer. profits are $0.

Simplex method, Solve the following Linear Programming Problem using Simple...

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

Inventory management, models of inventory management

models of inventory management

Application of operation reserch., how i make project report on "applicatio...

how i make project report on "application of or".i want help from you.can you give me idea to complete this report..

Maths assignment , Maxz=3x1-2x2 St x1 -x2>_0, 3x1-x2 _0

Maxz=3x1-2x2 St x1 -x2>_0, 3x1-x2 _0

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages