ECAT Mathematics Linear Inequalities and Linear Programming Test Online

ECAT Math Linear Inequalities and Linear Programming

ECAT Math Linear Inequalities and Linear Programming Chapter Online Test

Total Questions: 50
Time Allowed: 20 Minutes
Total Marks: 50
How to Attempt Test: Please choose the right Option in MCQ-type question.
Test Helpful For: ECAT Entry Test
Mathematics Online Test
Interview Questions about Mathematics
All Universities Entrance Test
Recruitments Tests

 0%

Page 1 of 2

1. The regions of inequality is also called

2. The variables used in the system of linear in equality is

3. 2x + 3 < 0 is

4. x = 0 is not in the solution of inequality

5. ax + by < c is linear inequality in

6. The symbol used for less than or equal to is

7. The graph of linear inequality with two variables represents

8. x = -1 is in the solution of inequality

9. 2x + 3 = 0 is

10. (3, 2) is not in the solution of inequality

11. (0, 0) is in the solution of inequality

12. The process used to maximize or minimize a quantity is called

13. A point of solution region where two of its boundary line intersect is called

14. x = 4 is in the solution of

15. Non negative constraints are also known as

16. The points (x, y) which satisfy the linear inequality in two variables x and y form is

17. ax + b < c is

18. A function which is to be maximized is called

19. (0, 1) is in the solution of inequality

20. An expression involving any one of the symbols < (less than,) > (greater than), ≤ (less than or equal to), ≥ (greater than or equal to) is called

21. For ax + by ≤ c the equation ax + by = c is called

22. X = -5 is not in the solution of inequality

23. (3, 2) is in the solution of inequality

24. 2x + 3 ≤ 0 us

25. x – 1 is the solution of inequality


 

You Can Learn and Gain more Knowledge through our Online Quiz and Testing system Just Search your desired Preparation subject at Gotest.

Your Related

Leave a Reply

Your email address will not be published. Required fields are marked *

Back to top button
error: