Q77.रैखिक प्रोग्राम समस्या के लिए अधिकतम Z = x + 3y; प्रतिबन्ध 3x + 2y ≤ 6, 3x + y = 4 तथा x, y ≥ 0, की द्वैती समस्या का कथन है —
Correct answer: न्यूनतम Z_D = 6w₁ + 4w₂ − 4w₃; प्रतिबन्ध 3w₁ + 3w₂ − 3w₃ ≥ 1; 2w₁ + w₂ − w₃ ≥ 3; तथा w₁, w₂, w₃ ≥ 0
Permanent old-paper question page
Question 77
SR. TEACHER (SEC. EDU.) COMP. EXAM 2025 2026 question with answer
Read and share this previous-year question using its permanent link.