Mathematics · Linear Programming
रैखिक प्रतिबंधों की प्रणाली AX = b (जहाँ X ≥ 0) के लिए सभी सुसंगत हलों (feasible solutions) का समुच्चय बनाता है:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1एक अवतल समुच्चय (concave set)
- 2एक असंबद्ध समुच्चय (disconnected set)
- 3एक गैर-उत्तल समुच्चय (non-convex set)
- 4एक उत्तल समुच्चय (convex set)✓
सही उत्तर देखें
एक उत्तल समुच्चय (convex set)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Linear Programming MCQs →Want more practice questions on Linear Programming?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Linear Programming