🏠 Home > Calculus > 5. The derivative in graphing and applications > Classification Of Optimization Problems
← Back to 5. The derivative in graphing and applications

📝 Classification Of Optimization Problems

📖 From Calculus • 5. The derivative in graphing and applications • 27 questions available

Practice MCQs for Classification Of Optimization Problems. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-15

8
Easy Questions
12
Medium Questions
7
Hard Questions

📝 Sample Questions

Q1. A problem whose objective function is convex and whose feasible set is also convex is classified as:

🔹 A. Convex optimization
🔹 B. Non‑convex optimization
🔹 C. Linear programming
🔹 D. Dynamic programming

💡 Difficulty: easy | ✅ Correct: A

Q2. An offshore company models the cost of locating a rig as \(C(x)=0.5x^{2}+30x+200\), where \(x\) is the distance (in km) from shore. What is the optimal distance that minimizes cost?

🔹 A. \(x=-30\) km (not feasible)
🔹 B. \(x= -30\) km (feasible)
🔹 C. \(x= -30\) km (ignore sign)
🔹 D. \(x=-30\) km (invalid, choose positive root)

💡 Difficulty: medium | ✅ Correct: A

Q3. Proving that the traveling salesman problem (TSP) is NP‑hard involves which type of argument?

🔹 A. Reduction from a known NP‑complete problem
🔹 B. Direct enumeration of all routes
🔹 C. Construction of a polynomial‑time algorithm
🔹 D. Application of the simplex method

💡 Difficulty: hard | ✅ Correct: A

⬆️ View all questions in the quiz below

🔗 Related Topics

📝 Approximating Roots📝 Areas and Limits📝 Continuity in Applications📝 Continuity of Compositions📝 Continuity of Inverse Functions
🚀 Start Quiz 📝 Practice Mode