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

Applications of statistics in management, In a business, statis...

In a business, statistics is used to study the demand and market characteristics of the product or service being sold. In fact, market research

Help, A paper mill produces two grades of paper viz., X and Y. Because of r...

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

ASSIGNMENT PROBLEM, . Explain in brief the phases of Operations Research. 5...

. Explain in brief the phases of Operations Research. 5 +5 = 10 marks (200 - 250 words each) Q3. Solve the following Linear Programming Problem using Simple method. Maximize Z= 3

Linear Programming models, In your own words, describe the special cases of...

In your own words, describe the special cases of integer programming and binary programming: what makes these problems different? Give an example of each, pointing out why they mus

Game theory, if there were n workers and n jobs there would be

if there were n workers and n jobs there would be

Research, Discus and explain both probability and none probability sampling...

Discus and explain both probability and none probability sampling techniques

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

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

OR TECHNIQUES, EXPLAIN THE OR TECHNIQUES

EXPLAIN THE OR TECHNIQUES

Applicattion of operation reserach, applications of operation research

applications of operation research

Linear programming, #questiona paper mill produce two grades of x&y.becouse...

#questiona paper mill produce two grades of x&y.becouse of raw material reswtriction

Write Your Message!

Name

Email id

Message

Verfication Code

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

Submit Assignment

User Account

All Pages