OnlineCBT Logo OnlineCBT

Mathematics · JEE | LINEAR PROGRAMMING

हिन्दी

Match List-I with List-II: List-I List-II A Objective function I \( x \ge 0, y \ge 0 \) B Constraints II \( Z = ax + by \) C Non-negative restrictions III Region determined by all constraints D Feasible region IV Linear inequalities restricting variables Choose the correct answer from the options given below:

Match List-I with List-II:

List-I List-II
A Objective function I \( x \ge 0, y \ge 0 \)
B Constraints II \( Z = ax + by \)
C Non-negative restrictions III Region determined by all constraints
D Feasible region IV Linear inequalities restricting variables

Choose the correct answer from the options given below:

  1. A
    A-(II), B-(IV), C-(I), D-(III)
  2. B
    A-(I), B-(II), C-(III), D-(IV)
  3. C
    A-(III), B-(I), C-(IV), D-(II)
  4. D
    A-(IV), B-(III), C-(II), D-(I)
View Answer & Solution

Correct answer · Option A

A-(II), B-(IV), C-(I), D-(III)

Explanation

Matching terms: Objective function is \( Z = ax + by \), Constraints are linear inequalities, Non-negative restrictions are \( x \ge 0, y \ge 0 \), and Feasible region is the common region.
Address Contact

+91 9694780911

E-mail

onlinecbtportal@gmail.com

Helpline Number

+91 9694780911


Click To Download
Get it on Google Play

ऐप डाउनलोड करने
के लिए Google Play पर
उपलब्ध है

WhatsApp Chat