arrow
arrow
arrow
Let S be a convex subset of the plane, z=c1x1+c2x2, ∀(x1,x2)∈Sz=c_1x_1+c_2x_2,\;\forall(x_1,x_2)\in Sz=c1​x1​+c2​x2​,∀(x1​,x2​)∈S​ bounded by lin
Question

Let S be a convex subset of the plane, z=c1x1+c2x2, ∀(x1,x2)∈Sz=c_1x_1+c_2x_2,\;\forall(x_1,x_2)\in S​ bounded by lines in the plane. Then, a linear function where c1,c2c_1,c_2​ are scalars, attains its optimum value at

A.

The origin only

B.

Any points

C.

​​​The vertices only

D.

None of these

Correct option is C

Given:​
S is a convex region bounded by straight lines.
​z=c1x1+c2x2z=c_1x_1+c_2x_2​ is a linear objective function.
Formula Used:
The fundamental theorem of linear programming states that if an optimum solution exists, it occurs at an extreme point (vertex) of the feasible region.​
Solution:
Since the feasible region is convex and bounded by straight lines, the optimum value of the linear objective function is attained at one or more vertices of the feasible region.
Hence, the correct option is the vertices.
The correct answer is (c) The vertices only.

Free Tests

Free
Must Attempt

UPTET : Paper 1 Full Mock - 01

languageIcon English
  • pdpQsnIcon150 Questions
  • pdpsheetsIcon150 Marks
  • timerIcon150 Mins
languageIcon English
Free
Must Attempt

UPTET : Paper 2 Maths & Science Full Mock - 01

languageIcon English
  • pdpQsnIcon150 Questions
  • pdpsheetsIcon150 Marks
  • timerIcon150 Mins
languageIcon English
Free
Must Attempt

UPTET : Paper 2 Social Science Full Mock - 01

languageIcon English
  • pdpQsnIcon150 Questions
  • pdpsheetsIcon150 Marks
  • timerIcon150 Mins
languageIcon English
test-prime-package

Access ‘Punjab Teaching Exam’ Mock Tests with

  • 1.5 Lakhs+ Mocks and Previous Year Papers
  • Unlimited Re-Attempts
  • Personalised Report Card
  • 500% Refund on Final Selection
  • Largest Community
students-icon
589k+ students have already unlocked exclusive benefits with Test Prime!
Our Plans
Monthsup-arrow