Mathematics · Linear Programming
एक रैखिक प्रोग्रामन समस्या (LPP) में, भौतिक राशियाँ (चर x और y) ऋणात्मक मान नहीं ले सकती हैं। इसलिए, संपूर्ण LPP निरूपण को किन ॠणेतर अवरोधों (non-negativity constraints) को संतुष्ट करना चाहिए?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1x = y
- 2x ≤ 0, y ≤ 0
- 3x + y = 0
- 4x ≥ 0, y ≥ 0✓
सही उत्तर देखें
x ≥ 0, y ≥ 0
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
Preparing for Mathematics?
Practice full-length Mathematics 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