Vedclass
Class 12MathematicsLinear ProgrammingMCQ based Question
Easy

$A$ feasible solution to an $LP$ problem . . . . . . .

GSEB 2020All GSEB
  • A
    must satisfy all of the problem's constraints simultaneously
  • B
    need not satisfy all of the constraints,only some of them.
  • C
    must be a corner point of the feasible region
  • D
    must optimize the value of the objective function.
Share

Explore More

Browse All

Question Bank

12

All Subjects

Class 12 Questions

Class 12

Mathematics Questions

Chapter

Linear Programming

Subtopic

MCQ based Question

Previous Year

GSEB 2020 PaperAll GSEB years →

Similar Questions

The feasible region for a $LPP$ is shown in the figure. Find the minimum value of $Z=11x+7y$.

Medium
View Solution

In a Linear Programming Problem ($L$.$P$.$P$.), the corner points of the feasible region determined by the constraints $3x - y \geq 6$, $x \leq 3$, $y \leq 2$, $y \geq 0$, and $x \geq 0$ are:

DifficultMHT CET 2026
View Solution

The corner points of the feasible region are $(0,10), (5,5), (15,15), (0,20)$. The maximum value of $Z = 3x + 9y$ is . . . . . . .

EasyGSEB 2024
View Solution

If for a linear programming problem the feasible region is bounded,then the objective function has . . . . . . .

EasyGSEB 2022
View Solution

In solving the $LP$ problem: "Minimize $z = 6x + 10y$ subject to $x \geq 6, y \geq 2, 2x + y \geq 10, x \geq 0, y \geq 0$." The redundant constraints are $....$

Easy
View Solution

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo