103 results authored by Musa Mammadov - search across all users.
-
Question in Deakin SIT190
Differentiate $\displaystyle e^{ax^{m} +bx^2+c}$
-
Question in Deakin SIT190
Differentiate $\displaystyle (ax^m+b)^{n}$.
-
Question in Deakin SIT190
Calculating gradients - polynomials
-
Question in Deakin SIT190
A question to practice simplifying fractions with the use of factorisation (for binomial and quadratic expressions).
-
Question in Deakin SIT190
Use laws for addition and subtraction of logarithms to simplify a given logarithmic expression to an arbitrary base.
-
Question in Deakin SIT190
Questions testing rather basic understanding of the index laws.
-
Exam (4 questions) in Musa's workspace
LP: Constraint Programming
-
Question in Musa's workspace
No description given
-
Question in Musa's workspace
No description given
-
Question in Musa's workspace
No description given
-
Question in Musa's workspace
No description given
-
Exam (1 question) in Musa's workspace
No description given
-
Question in Musa's workspace
This question tests the student's ability to solve Integer Programming problems applying Population-based Metaheuristics.
-
Exam (1 question) in Musa's workspace
No description given
-
Question in Musa's workspace
This question tests the student's ability to solve Integer Programming problems applying Single State Metaheuristics.
-
Exam (2 questions) in Musa's workspace
No description given
-
Question in Musa's workspace
This question tests the student's ability to model and solve Integer Programming problems by Branch and bound method
-
Question in Musa's workspace
This question tests the student's ability to model and solve Integer Programming problems by Branch and bound method
-
Exam (2 questions) in Musa's workspace
No description given
-
Question in Musa's workspace
This question tests the student's ability to solve Linear Programming problems by hand using the Simplex Method.
-
Question in Musa's workspace
This question tests the student's ability to solve Linear Programming problems by hand using the Simplex Method.
-
Exam (2 questions) in Musa's workspace
No description given
-
Question in Musa's workspace
Solving binary optimisation problems using Computational Packages
-
Question in Musa's workspace
Solving continuous optimisation problems using Computational Packages
-
Exam (7 questions) in Musa's workspace
LP: Formulating dual problems
-
Question in Musa's workspace
Formulating duality problems
-
Question in Musa's workspace
Formulating duality problems
-
Question in Musa's workspace
Formulating duality problems
-
Question in Musa's workspace
Formulating duality problems
-
Question in Musa's workspace
Formulating duality problems