Skip to content

Blake Rayvid

Menu
  • About
  • Portfolio
Menu

Category: Optimization

Projects involving maximizing efficiency or finding extremal values, including a traveling salesman solver and minimum variance portfolio selection.

Java Elevator Simulator

Posted on July 1, 2026July 23, 2026 by Blake

This is an interactive elevator simulator written in Java with Swing graphics. Users can click the ▲ (up) and ▼ (down) buttons on each floor to spawn riders and call the elevator. When a rider enters the elevator, the user selects their destination floor via a pop-up panel. The program uses a scheduling algorithm called…

Continue reading

Based News Reader

Posted on April 19, 2025July 8, 2026 by Blake

This script fetches the latest Google News RSS headlines for a user-supplied list of topics and regularly updates an HTML page hosted on Railway. Gemini AI prioritizes the headlines based on the user’s preferences. Designed to be scheduled with cron on any Unix-based system. 🗞️ news.blakerayvid.com How It Works 🔗 View on GitHub

Continue reading

TQQQ Trading Algorithm

Posted on August 21, 2024July 17, 2026 by Blake

Developing a successful trading algorithm is about finding the right balance between capturing market gains and managing risks. In this capstone project for the Flatiron School Data Science Bootcamp, I created and refined a QuantConnect trading algorithm that combines a dynamic strategy for SPY with a risk-managed approach for TQQQ. The goal was to optimize…

Continue reading

Skyrim Alchemy Optimizer

Posted on December 1, 2022July 8, 2026 by Blake

This Jupyter notebook can be used to maximize alchemy profitability using the ingredients you have on hand in The Elder Scrolls V: Skyrim. It uses integer linear programming from scipy.optimize.milp to determine which potions to make, and in what quantities, to maximize total value. It needs a csv file of the ingredients you have with…

Continue reading

RouteCat

Posted on May 1, 2022July 23, 2026 by Blake

This is a clustering traveling salesman solver for delivery, alleycats and more. Give the app a list of addresses and it will return the optimal groups for up to 4 drivers and provide the order to visit the stops to minimize travel time, and a map with the ideal route. 🔗 routecat.blakerayvid.com View on GitHub

Continue reading

Efficient Portfolio

Posted on December 7, 2020July 8, 2026 by Blake

This is a Python implementation of Robert C. Merton’s efficient or minimum-variance portfolio algorithm from the paper An Analytic Derivation of the Efficient Portfolio Frontier (1972). Building on the work of Harry Markowitz, Merton describes a way to assign weights to a list of securities to make a portfolio that has the lowest variance in…

Continue reading

Categories

  • Data Science
  • Exploration
  • Finance
  • Health
  • Interactive
  • Optimization
  • Utilities

Tags

D3.js Desmos Docker Express.js FFmpeg Flask Gemini API Google Maps API HTML/CSS/JS Java Java-AWT Java-Swing MATLAB Matplotlib Netlify NetworkX Next.js NLP Node.js NumPy P5.js Pandas Pillow PostgreSQL Python PyTorch QuantConnect Railway React.js Scikit-Learn SciPy TensorFlow Tesseract WeasyPrint YFinance API

© 2026 Blake Rayvid. All rights reserved.