Profit Maximisation Function using GA

Example of maximization for items list when user is scrolling the page

To implement Optimization (maximization) problem through Linear programming in Python Language.

A series of genetic algorithms in Common Lisp and Racket, evolving from simple to more complex ones

Calculating the maximum semi-ellipsoid volume using Reduced Gradient Descent method with total surface area given as a constraint.

solution of problems !!

Maximize revenues of Online Retail Business with Thompson Sampling algorithm

Projek Akhir Semester Riset Operasi

Multi-period Home Healthcare Routing Problem (HHCRP) with qualification, synchronization and time windows constraints.

Lightweight Tool for Genetic Algorithms in Python

Using the Minimax algorithm, an AI Tic Tac Toe game is implemented.

A multi-threaded Simulated Annealing core in C

Implemented fully documented Particle Swarm Optimization algorithm (basic model with few advanced features) using Python programming language

SimplexPy is a compact python library that automatically solves `Linear Programming Equations` i.e Maximization problems, easily and quickly while giving you neat results.

SimplexCPP is a c++ library that helps solves `Linear Programming Equations` i.e Maximization problems, easily also providing you with neat results.

Simulation of the Secretary Problem

The library provides a general genetic algorithm. It is simple, easy to use, and very fast. All you need to do is to define the fitness function and its variables. There are many examples of how to deal with classic genetic algorithms problems.

A modified Traveling Salesman Problem (TSP) optimization where a directed graph tour starting and ending at the first node is chosen so to maximize a custom objective function (net profit)

Simplex-Method using Bland Rule