Problems based on lpp when feasible region is a line segment, Operation Research

Assignment Help:

Problems based on LPP when feasible region is a line segment or it does not exist.

1. Maximize z = 2x+3y subject to the constraints

X + y ≤ 1

X + y ≥ 3

X, y ≥ 0

script

solution

1. Let z = 2x+3y

2. Let us draw lines X +y = 1 and x + y = 3using suitable points on the graph.

3. There is no common region satisfying the given conditions

X +y = 1 and x + y = 3

Related Discussions:- Problems based on lpp when feasible region is a line segment

T, #Principles of OR

#Principles of OR

Vogel''s approximation method, I''m getting a negative value in the one of ...

I''m getting a negative value in the one of the Supply/Stock columns while solving a problem in Vogel''s approximation method. Is it possible or am I doing anything wrong?

Mean deviation - measure of dispersion, MEAN DEVIATION Mean deviati...

MEAN DEVIATION Mean deviation of a series is the arithmetic average of the deviations of various items from the median or mean of that series. Median is preferred

Linear programming, what is optimal condition?

what is optimal condition?

Evaluate a product from the view point of quality, This assignment requires...

This assignment requires you to evaluate a product from the view point of quality, both quality of design (as perceived by the user) and quality of conformance. To ensure that we a

Linear programming, maximize z=3x1+2*2 subject to the constraints x1+x2=4 x...

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

Multiple objectives- sampling decisions, Multiple Objective s The sam...

Multiple Objective s The sample may vary according to the objective of the research. There may several objectives of marketing research so the sample size may vary a

Mba, in a rectangular game ,pay of matrix of player A is as follows

in a rectangular game ,pay of matrix of player A is as follows

Operation, #question.A paper mill produces two grades of paper viz., X and ...

#question.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 grad

Network problem, Consider the following network where the value on each arc...

Consider the following network where the value on each arc represents the capacity of that arc. Use the augmenting path algorithm to find the value of the maximum flow from node 1

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