Therefore the correct answer is the B option.

The number of labelled trees on 5 vertices is 5^5-2=5³=125.

For the point (20, 5),

F = 3x + 3y = 3.20 + 3.5 = 75

We must evaluate the values of the goal function   

at the corner points.

Thus, the maximum of

over the constraint set will occur at (10,20).

Correct answer is D.

the correct answer is B.

It is known that in a complete graph all of the vertices are adjacent to each other.

Let us determine the integral with Sarrus’ rule. For the determinant above we have

If we solve this equation we get

Therefore the

correct answer is A.

The price may be found as

Using the integral formula for the producer surplus, we obtain

which is the required answer.

The coefficient matrix of the system of linear equations is

The other matrices we use in the Cramer’s rule are

The determinant of these matrices are

Hence the solution of this system of linear equations is

The maximum value is 30.
The correct answer is E.

Since a₃₁=0 and b₃₁=3 then it is clear that

Furthermore, one can easily check that

When we consider the given matrix, we find

maximum {-1,-2}=-1. So the answer is A.

minimum {5,5,3,6}=3.

From the system 

we have

The corner points are: (0,0), (0,5), (2,5), (7,0). The maximum is attained at the point (2,5) and equals

The correct answer is B.

We will use the Cramer’s rule. The system above can be written as

for

and

The solution of this system of linear equations is

where

Now calculating determinants with the Sarrus’ rule we get

Hence our solution becomes

The correct answer is D.

We should find the corner points firstly. When we solve the equations  

we get a corner point (-3,1). In addition considering all constraints (especially x≤0, y≥0) we see that 

are other corner points of the constraint set. Secondly, we will find the values of these corner points under the goal function:

The maximum value is 3/4.

olmak üzere

sayısının şifrelenmişi

olur. Doğru cevap E’dir.

The point (3,1) only.

Since a 2x3 matrix has 3 columns we can multiply it by a matrix which has 3 rows, so one example of this type of matrices is 3x4.