Dashboard

View Details

LPP PART - 2

Name

For the constraint of a linear optimizing function z=x1+x2, given by x1+x2≤1,3x1+x2≥3 and x1,x2≥0

Objective function

Constraint equations

Not required

None of these

The feasible solution of a L.P.P. belongs to

First and second quadrant

First and third quadrant

Second quadrant

Only first quadrant

The value of objective function is maximum under linear constraints

At the centre of feasible region

At (0,0)

At any vertex of feasible region

The vertex which is at maximum distance from (0,0)

The region represented by 2x+3y−5≤0 and 4x−3y+2≤0, is

Not in first quadrant

Bounded in first quadrant

Unbounded in first quadrant

None of these

Objective function of a L.P.P, is

A constraint

A function to be optimized

A relation between the variables

None of these

The graph of inequations x≤y and y≤x+3 is located in

II quadrant

I, II quadrants

I, II, III quadrants

II, III, IV quadrants

The minimum value of z=2x1+3x2 subject to the constraints 2x1+7x2≥22, x1+x2≥6, 5x1+x2≥10 and x1, x2≥0 is

For the constraint of a linear optimizing function z=x1+x2, given by x1+x2≤1,3x1+x2≥3 and x1,x2≥0

There are two feasible regions

There are infinite feasible regions

There is no feasible region

None of these