A problem which seeks to maximise or min...

A problem which seeks to maximise or minimise a linear function (say of two variables x and y) subject to certain constraints as determined by a set of linear inequalities is called an optimisation problem.

Text Solution

Verified by Experts

The correct Answer is:

True

Promotional Banner

Promotional Banner

Topper's Solved these Questions

LINEAR PROGRAMMING
ACCURATE PUBLICATION|Exercise QUESTIONS CARRYING 6 MARKS |7 Videos
LINEAR PROGRAMMING
ACCURATE PUBLICATION|Exercise QUESTIONS CARRYING 1 MARK (TYPE-II : FILL IN THE BLANKS QUESTIONS) |11 Videos
INVERSE TRIGONOMETRIC FUNCTIONS
ACCURATE PUBLICATION|Exercise QUESTIONS CARRYING 4 MARKS|27 Videos
MATRICES
ACCURATE PUBLICATION|Exercise QUESTIONS CARRYING 6 MARKS |4 Videos

ACCURATE PUBLICATION-LINEAR PROGRAMMING -QUESTIONS CARRYING 1 MARK (TYPE-III : TRUE OR FALSE QUESTIONS)

If the feasible region for a linear programming problem is bounded, th...
Text Solution
|
The minimum value of the objective function Z = a x + b y in a linear ...
Text Solution
|
Maximum value of the objective function Z= ax+by in a LPP always occur...
Text Solution
|
In a LPP the minimųm vaļue of the objective function Z= ax+by is alway...
Text Solution
|
In a LPP, the maximum value of the objective function Z-ax+by is alway...
Text Solution
|
Linear function Z= ax + by, where a, b are constants, which has to be ...
Text Solution
|
The linear inequalities or equations or restrictions on the variables ...
Text Solution
|
A problem which seeks to maximise or minimise a linear function (say o...
Text Solution
|
Any point in the feasible region that gives the optimal value (maximum...
Text Solution
|
Any point which satisfies x ge 0, y ge 0 lies in second quadrant.
Text Solution
|