Home
Class 12
MATHS
A linear programming problem is one that...

A linear programming problem is one that is conerned with finding the ….A…. Of a linear function called ….B… function of serval variables ( say x and Y) , subject to the condiations that the variables are ….C…. And satisfy set of linear inequalities called linear constriants .
Here, A,B C are respectively

A

objective ,optimal value, negative

B

optimal value, objective ,negative

C

optimal value , objective ,non- negative

D

objective ,optimal value, non- negative

Text Solution

Verified by Experts

The correct Answer is:
C
A linear programming problem is one that is concerned with finding the optimal value (maximum or minimum value) of a linear function called objective function of several variables (say x and y), subject to the conditions that the variables are non-negativ'3 and satisfy a set of linear inequalities called linear constraints.
Promotional Banner

Topper's Solved these Questions

  • Linear Programming

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise EXERCISE 1 (TOPICAL PROBLEMS )(Solution of LPP Graphical Method )|15 Videos

  • Linear Programming

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise EXERCISE 2 (MISCELLANEOUS PROBLEMS )|30 Videos

  • LINE

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET Corner|3 Videos

  • MATHEMATICAL LOGIC

    MHTCET PREVIOUS YEAR PAPERS AND PRACTICE PAPERS|Exercise MHT CET CORNER|22 Videos

Similar Questions

Explore conceptually related problems

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 a/an

In linear programming problem, the linear function Z subject to certain conditions determined by a set of linear inequalities with variables as non-negative, is

In a LPP, the linear inequalities or restrictions on the variables called.

Let R be the feasible region (convex polygon) for a linear programming problem and Z = ax + by be the objective function. Then, which of the following statements is false? A) When Z has an optimal value, where the variables x and y are subject to constraints described by linear inequalities, this optimal value must occur at a corner point (vertex) of the feasible region . B)If R is bounded, then the objective function Z has both a maximum and a minimum value on Rand each of these occurs at a corner point of R . C) If R is unbounded, then a maximum or a minimum value of the objective function may not exist D) If R is unbounded and a maximum or a minimum value of the objective function z exists, it must occur at corner point of R

In a linear programming problem, the constraints on the decision variables x and y are x − 3y ge 0,y ge 0, 0 le x le 3 . The feasible region

The linear inequalities or equations or restrictions on the variables of a linear programming problem are called A)linear relations B) constraints C) functions D) objective functions

The wide applicability of linear programming problem is in a A) industry B) commerce C) management science D) all of these

Solve the linear programming problem under the following restrictions.2x+y =0,y>=0 Also,find the maximum value of Z=x+3y