i am completely confused how is this even physically possible what the heck
Answer:
x₁ = 20 x₂ = 0
z (min) = 20
Step-by-step explanation:
According to the problem statement:
Let´s call
Objective quiz = x₁ Recall quiz = x₂
First constraint
Quantity of quizzes at least 15
x₁ + x₂ ≥ 15
Second constraint:
Preparation time at least 300 minutes, then
15*x₁ + 30*x₂ ≥ 300
Third constraint
Average score at least 85 points
7*x₁ + 5*x₂ ≥ 85
General constraint x₁ ≥ 0 x₂ ≥ 0
Objective function z is:
z = 1* x₁ + 1,5*x₂ to minimize
The model:
z = x₁ + 1,5x₂ to minimize
Subject to
x₁ + x₂ ≥ 15
15*x₁ + 30*x₂ ≥ 300
7*x₁ + 5*x₂ ≥ 85
Using Atozmax (online solver) we find
x₁ = 20 x₂ = 0
z (min) = 20
The number of ways a teacher can create a seating chart is 25!
<u>Explanation:</u>
Given:
Number of students = 25
Number of chairs = 25
Number of seating chart = ?
The number of seating arrangement would be 25! as there is no repetition of a student occupying the seat.
Therefore, the number of ways a teacher can create a seating chart is 25!
< because it used absolute value to make the |2|=2, which keeps it the same cause it’s already positive
