Home
Class 12
MATHS
In case of a linear programming problem,...

In case of a linear programming problem, feasible region is always

A

a convex set

B

a concave set

C

a bounded convex set

D

a bounded concave set

Text Solution

Verified by Experts

The correct Answer is:
A
In case of a linear programming problem feasible region is always a convex set.
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

Linear programming problems

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

Define the feasible region.

The variables x and y in a linear programming problem are called A) decision variables B) linear variables C) optimal variables D) None of these

Objective function of a linear programming problem is

If the constraints in a linear programming problem are changed

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

Define a corner point of a feasible region.

Which of the term is not used in a linear programming problem? A) optimal solution B)Feasible solution C)concave region D)objective functions