This paper presents a novel, robust, efficient, and simple optimization algorithm called the Object-Oriented Programming Optimization Algorithm (OOPOA) for tackling constrained and unconstrained optimization problems. The algorithm is inspired by the inheritance concept of Object-Oriented programming languages, where the features of a class are classified into three types according to inheritance probability: public, private, and protected. The object-oriented programming inheritance concept is implemented in the algorithm to update the population for the next generations. The proposed algorithm ensures exploitation by selecting the solution with the highest fitness to be inherited in each iteration. It ensures exploration by applying a mutation process that helps explore wide regions in the search space. The performance of this technique is demonstrated by solving 34 different optimization tasks, including 20 standard benchmark problems, ten IEEE Congress of Evolutionary Computation benchmark test functions, and four constrained real-world engineering design problems.