Mathematics · Linear Programming and Optimization
दो उत्तल समुच्चयों (convex sets) का प्रतिच्छेदन (intersection):
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1हमेशा एक रिक्त समुच्चय होता है
- 2कभी भी एक उत्तल समुच्चय नहीं होता है
- 3हमेशा एक उत्तल समुच्चय नहीं होता है
- 4हमेशा एक उत्तल समुच्चय होता है✓
सही उत्तर देखें
हमेशा एक उत्तल समुच्चय होता है
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 and Optimization MCQs →Want more practice questions on Linear Programming and Optimization?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Linear Programming and Optimization