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

Operations research 2, management wants to know how many supervisors should...

management wants to know how many supervisors should be hired, and what could be the optimum workload distribution to be applied, given a number of constraints

Components of the product, The manufacturer of the product is finding that,...

The manufacturer of the product is finding that, in order to stay competitive, a number of things need to happen: Components of the product need to be made from more sustaina

Liner proggraming , A paper mill products two grade of paper viz., X & Y. B...

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

Linear programimng, how i do project in linear programming

how i do project in linear programming

Linear programing problems, basic requirements for solving linear programin...

basic requirements for solving linear programing using simplex method

Research abstracts, Research Abstracts Abstracts of researches comp...

Research Abstracts Abstracts of researches completed are available from the followings publications: a. ICSSR Research Abstracts: contain abstracts of research projects

Linear programing, Solve the following Linear Programming Problem using Sim...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2

Assigment , b. A paper mill produces two grades of paper viz., X and Y. Bec...

b. 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 pape

Voggles approximation, How to derive solution for non degenracy

How to derive solution for non degenracy

MINIMIZATION., Consider the LP min ?? = 50??1 + 100??2 3 ??.??. 7??1+2??2=2...

Consider the LP min ?? = 50??1 + 100??2 3 ??.??. 7??1+2??2=28 2??1+12??2=24 ??1,??2=0 a. A basic solution of the constraint equations of this problem has how many basic variables,

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages