Discussion
Non-negativity constraints in a Linear Programming problem is represented as :
Answer: D
The non-negativity constraints are X \(\geq\) 0 and Y \(\geq\) 0.
In a linear programming problem the decision variables represent physical quantities, such as units of two products to be made, which cannot be negative. Every LP formulation therefore adds the constraints that each variable is greater than or equal to zero, which confines the feasible region to the first quadrant.
The other options require one or both variables to be zero or negative, which would describe meaningless negative production levels.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development