Mathematics · Linear Programming
निम्नलिखित रैखिक प्रोग्रामिंग समस्या पर विचार करें: अधिकतम करें Z = 40x 1 + 50x 2 जबकि प्रतिबंध निम्नलिखित हैं: x 1 + 2x 2 ≤ 40, 4x 1 + 3x 2 ≤ 120, x 1 , x 2 ≥ 0. तो इष्टतम (optimal) समाधान है:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Z = 1360, x 1 = 19, x 2 = 12 के लिए
- 2Z = 1460, x 1 = 24, x 2 = 10 के लिए
- 3Z = 1360, x 1 = 24, x 2 = 8 के लिए✓
- 4Z = 1600, x 1 = 30, x 2 = 8 के लिए
सही उत्तर देखें
Z = 1360, x 1 = 24, x 2 = 8 के लिए
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