The aim of this course is to master the methods of Operations Research (OR) by defining the linear optimization model that is specific to each problem studied and by solving the problem using the numerical simplex method in Linear Programming (P.L) or by the graphical method in the 1D, 2D, 3D and possibly 4D cases (problems involving time as the 4th variable) to determine the best possible choice that satisfies optimal requirements while respecting certain regional equality and/or inequality constraints.This book is intended to be used as a course in Operations Research. It contains the basic definitions needed to define a linear optimization problem. It introduces the mathematical way of writing an optimization model to facilitate resolution and avoid confusion between objective function and linking equations. A summary presentation of the exercises in this collection is offered to students as part of their tutorials, reminding them that a table of possible solutions to an exercise using the simplex numerical method summarizes the calculations that can be carried out manually.