# A Simple Rule to find a Basic Feasible Solution

## TL;DR

This paper introduces a straightforward algorithm, similar to Bland's rule, for efficiently finding a basic feasible solution in the initial phase of the Simplex Algorithm.

## Contribution

It presents a simple, proven rule to identify a basic feasible solution, enhancing the initial step of the Simplex Method.

## Key findings

- The algorithm reliably finds basic feasible solutions.
- It simplifies the initial phase of the Simplex Algorithm.
- The method is easy to implement and understand.

## Abstract

This short note provides and proves an easy algorithm to find a basic feasible solution for the Simplex Algorithm. The method uses a rule similar to Bland's rule for the initial phase of the algorithm.