MathematicsNEB 2076 (old course)

a) Graphically shade the feasible region for the constraints x+2y 7 , x y 4 , x, y 0 . [2] b) Convert hexadecimal number 81A into Octal number. [2] c) Using Gauss elimination method, solve the…

6

a) Graphically shade the feasible region for the constraints , , . [2] b) Convert hexadecimal number 81A into Octal number. [2] c) Using Gauss- elimination method, solve the equations , . [2]

Answer

a) Feasible region for

The inequalities are linear, so the feasible region is a convex polygon bounded by the lines
.

-112345678-112345xyx=0
Feasible region satisfying all constraints

The intersection points of the boundary lines are:

Line 1 Line 2 Intersection

These points together with the origin form the vertices of the feasible polygon.
The shaded region in the figure is the set of all that satisfy all four inequalities.


b) Hexadecimal 81A → Octal

  1. Convert 81A (hex) to decimal.

  2. Convert 2074 (decimal) to octal.
    Divide repeatedly by 8, keeping remainders.

Division Quotient Remainder
2074 ÷ 8 259 2
259 ÷ 8 32 3
32 ÷ 8 4 0
4 ÷ 8 0 4

Reading remainders from bottom to top gives .

Answer:


c) Solve by Gauss‑Elimination

Step 1: Write the augmented matrix

Step 2: Eliminate from the second row

Multiply the first row by and subtract from the second row.

Step 3: Solve for

From the second row:

Step 4: Back‑substitute to find

Use the first equation:

Solution:


Discussion

Loading…

More Mathematics questions

All Mathematics old questions