Consider the following Linear Programming Problem (LPP): Maximize z = 3x1 + 2x2 Subject to x1 $\leq$ 4 x2 $\leq$ 6 3x1 + 2x2 $\leq$ 18 x1 $\geq$0, x2 $\geq$ 0
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- Consider the linear programme (LP) Max 4x + 6y Subject to 3x + 2y $\leq$ 6 2x + 3y $\leq$ 6 x, y $\leq$ 0 A...
- Directions: Carry Two Marks Each. Maximize Z = 3X1+ 2X2 Subject to –2X1 + 3X2 $\leq$ 9 X1 – 5X2 $\geq$ – 20...
- Consider the linear programme (LP) Max 4x + 6y Subject to 3x + 2y $\leq$ 6 2x + 3y $\leq$ 6 x, y $\leq$ 0 A...
- What would be the output of the following program? #include<stdio.h> #include<conio.h> #include<math.h> int...
- Consider the following facts about Jawaharlal Nehru National Solar Mission - 1. It is a sub-mission launche...
- In which of the following code fragments the variable ‘x’ is evaluated to 810 int x; a) x=32; b) x=16; c) x...
- What will be the output of the following program? #include<stdio.h> #include<conio.h> #include<math.h> int ...
- Consider the following substances: 1. Cellulose 2. Glucan 3. Lignin Which of the above substances is/are fo...