Linear Programming with Examples. C Code and Octave Script . 1. Introduction . 1.1 Setting the Task The linear programming problem consists of minimizing a linear objective function z: Notes To solve the problem, we will often write the objective… Read More
Branch and Bound Method for Travelling Salesman Problem Using Octave GNU Tool . 1. Travelling Salesman Problem The traveling salesman problem is formulated as follows. There are n cities. The traveling salesman must visit each city once and return to… Read More
Dynamic Programming and Travelling Salesman Problem. C Code and Octave Script . 1. Abbreviation Permutations of a set of n elements: Note: 0! = 1! = 1 A combination is a selection of k elements from a set containing n… Read More
Solving the Brachistochrone Problem using Pontryagin’s Method and the GNU Octave Tool . 1. Introduction . 1.1. The Brachistochrone Problem Let’s consider the Brachistochrone Problem. This is one of the first variational problems proposed and solved by Johann Bernoulli in… Read More
Solving the Brachistochrone Problem using Dynamic Programming and the GNU Octave Tool . 1. Abbreviation The functional: Euler–Lagrange equations: . 2. Introduction A functional is an operator that displays (calculates) a number for each function y(x). In this article I… Read More
Greedy Algorithm and Travelling Salesman Problem Using Octave GNU Tool . 1. Introduction A greedy algorithm is the search for the optimal solution to a given problem, which can be divided into many steps and the optimal solution can be… Read More
Monte Carlo Method Using Octave GNU Tool 1. Abbreviation 2. Introduction The Monte Carlo method is a numerical method for solving mathematical problems by modeling random variables using pseudo random numbers. I used the Octave Tool for my calculations. See… Read More
Overview of Search with C Source Code 1. Introduction A common task in programming is to search for some record in memory. This task is called data search. In the classical formulation of the problem, there are entries in computer… Read More
Bose–Chaudhuri–Hocquenghem (BCH) code: (15, 5, 7) and C Implementation Using the Octave GNU Tool 1. Abbreviation 2. Introduction This article is a continuation of the article: “Hamming Code and C Implementation Using the Octave GNU Tool” and “Hadamard Codes and… Read More
Hadamard Codes and C Implementation Using the Octave GNU Tool 1. Abbreviation 2. Introduction This article is a continuation of the article: “Hamming Codes and C Implementation Using the Octave GNU Tool”. Hamming codes, despite their elegance, can only fix… Read More