In the daily development of life, human beings find themselves in the need to make decisions, some more important than others, which will bring future consequences that may or may not be favorable. From this, the need arises to choose the best alternative whenever we are faced with a situation in which we must decide on something, in order to avoid any type of loss or disadvantage. The problem is that generally recognizing the best of the possible is not a trivial task. Through mathematics, we can find a solution to many of these problems, through their proper modeling and subsequent optimization processes.In general, such problems are composed of an objective function that must be maximized or minimized subject to a set of constraints. In some cases, reaching the solution is difficult because of the structure of the equations and/or inequalities that describe the objective function or the constraints. Based on the above, the objective of this document is to illustrate specific methods to facilitate the solution of certain problems that meet certain characteristics. The main intention is that the reader understands the mathematical foundation of the methods and learns to apply them. In this order of ideas, the separable programming method, fractional programming, and geometric programming will be discussed.