Volume-3-Issue-11-November,2025 International Journal of Modern Science and Research Technology

ISSN NO-2584-2706

A Clear Step-by-Step Revised Simplex Method

1.Gau Patrick Damulak; 2.Manjel Danladi
3.Felix Eli Wang; 4.Ukwu Chukwunenye

¹Department of Mathematics and Statistics, Plateau State Polytechnic,

Barkin-Ladi, Plateau State, Nigeria
2
Department of Mathematics, University of Jos, Plateau State, Nigeria

Abstract
The revised simplex method is a central step-by-step implementation. By working
algorithm in linear programming for solving through two representative examples, we
optimization problems efficiently. This demonstrate how the method operates in
paper offers a detailed, step-by-step practice.
exposition of its procedure tailored for
learners and practitioners. Without 2.Materials and Methods
performing comparative analyses, we focus To solve linear programming problems
on explaining each computational stage using the Revised Simplex Method, a
clearly. We illustrate the method through structured sequence of steps is followed to
two (2) numerical examples to demonstrate systematically reach the optimal solution.
its practical utility. The result is an The method begins by transforming the
accessible guide that bridges theorem and problem into a standard mathematical form
implementation, empowering readers to and then proceeds through iterative
apply the method themselves. calculations that update the solution until
optimality is achieved.
Keywords: Linear programming, revised
simplex method, simplex tableau, 2.1Formulation of Linear
computational procedure, mathematical Programming Problems
modeling. Formulation of linear programming
problems (LPP) involves translating a real-
1Introduction life problem into a mathematical model into
Linear programming is a fundamental tool in three (3) main components, namely:
optimization leveraged for modeling i.Decision Variables: These are the
decision-making in operations research, unknowns that represent the choices
logistics, economics, engineering and available.
business context. Traditional algorithms ii.Objective Function: This is the function to
such as the simplex method remain be maximized or minimized
foundational, but direct tableau updates iii.Constraints: These are the limitations or
grow burdensome for large systems. The requirements of the problems, expressed as
Revised Simplex Method addresses this by linear inequalities or equations.
updating only selected matrix components – We consider linear programs in standard
primarily the basis inverse and relevant form:
vectors – thus lowering memory and , subject to
computational demands. This work does not ,
aim to contrast the Revised Simplex with Where is an matrix, ,
other methods; rather, it seeks to explain its and

IJMSRT25NOV029 www.ijmsrt.com 71
DOI: https://doi.org/10.5281/zenodo.17658199
Volume-3-Issue-11-November,2025 International Journal of Modern Science and Research Technology
ISSN NO-2584-2706

3.Algorithm Steps: The real world problem can be formulated

The procedure is organized into nine (9) as;
clear steps;
Subject to the constraints
Step one (1): Convert the linear
programming problem (LPP) into standard
form
Standard form I: In this form, it is assumed
that an identity matrix is obtained after
introducing slack variables only. If the objective function is to be minimized,
Standard form II: If artificial variables are then convert the given problem into a
needed for an identity matrix, then two- problem of maximization by minimizing
phase method of ordinary simplex method is . Check whether all the
used in a slightly different way to handle are positive; if any one of the , then
artificial variables. multiply both sides of that constraint by
so as to get all . Add slack
Converting to Standard Form variables in the left hand side of constraint
Case I: Maximization Type of Problems and assign a zero coefficient to these in the
with Type of Constraints objective function .
Then write the problem in standard form as

subject to the constraints

and we find the initial basic feasible solution and obtain ,

by substituting the values of the decision
variables
equals zero i.e

Case II: Minimization Problems with constraints type

Here, we write in standard form as:

subject to the constraints

Where

IJMSRT25NOV029 www.ijmsrt.com 72
DOI: https://doi.org/10.5281/zenodo.17658199
Volume-3-Issue-11-November,2025 International Journal of Modern Science and Research Technology
ISSN NO-2584-2706

The initial basic solution is gotten by putting non-negativity constraints , hence it

, and we obtain , is not feasible. new variables called
, , which clearly violates Artificial variables are
added to left hand side (one on each
equations) as

and

Case III: Minimization Type of LPP

with mixed constraints
Example: Minimize
subject to: Then we can convert to standard form as:
Maximize

Subject to:
,
Then the problem can be be converted to
standard form as follows:
Minimize And is given by

Subject to:
Case V: Unbounded Solution
Example: Maximize

and the initial basic feasible solution Subject to:

( ) is given by:
,
, ,

Case IV: Maximization Type of LPP with The problem can be converted to standard
mixed constraints form as:
Maximize Multiply first constraints by and write in
Subject to: standard form

IJMSRT25NOV029 www.ijmsrt.com 73
DOI: https://doi.org/10.5281/zenodo.17658199
Volume-3-Issue-11-November,2025 International Journal of Modern Science and Research Technology
ISSN NO-2584-2706

And the initial basic feasible solution is Step Eight (8): Convert the key element
gotten by putting unity and all other elements of the key
and obtain , , , , column to zero and improve the value of
and . ̂
Step Two (2): Find the initial basis feasible Step Nine (9): Go to step Five (5) and
solution with initial basis repeat the procedure until an optimal
( Identity matrix) feasible solution is obtained or there is an
Step Three (3): Consider the objective indication of an unbounded solution.
function subject to and find
the value of ̂ ̂
and . Where 4. Results and Discussion
̂ ( ) and ̂ ( ) Two numerical examples are presented to
illustrate the Revised Simplex Method and
Step Four (4): Find the value of ̂ ( demonstrate each computational step
Cap inverse) where; clearly.
̂ Each example is solved step-wise,
( )
highlighting the critical operations involved
Step Five (5): Compute the net evaluation in reaching the optimal solution. The
̂ examples of increasing complexity
Where last row of ̂ illustrates the method’s application.
Case I: If all , then current Example 1
Use the revised simplex method to solve the
solution is an optimal solution. So find ̂
LPP
Case II: If atleast one , find the
most negative of them say
corresponding to the variable enters the subject to
basis.
Step Six (6): We compute Solution
̂ ̂ ̂
Step One (1): We convert the given
Case I: If all ̂ , then there exist an problem into its standard form by adding
unbounded solution to the LPP slack variables and
Case II: If atleast one ̂ , then find the
value of ̂ ̂ ̂
Step Seven (7): Write down the results in subject to
the revised simplex table and find the
minimum of Step Two (2): The initial basis feasible
̂ solution with initial basis
{ }
̂
and also find the key element. Step Three (3):

( ), ( ),

(Coefficient of the objective function.

IJMSRT25NOV029 www.ijmsrt.com 74
DOI: https://doi.org/10.5281/zenodo.17658199
Volume-3-Issue-11-November,2025 International Journal of Modern Science and Research Technology
ISSN NO-2584-2706

̂ ( ) ,̂ ( ) ( )

( )

Step Four (4):

=( )
(Coefficient of basis in the objective function)
( )

̂ ( ) ( )

Step Five (5): We compute the net evaluation

̂

( )

most negative, so enters the basis

Step Six (6):

̂ ̂ ̂ ( )( ) ( )

̂ ̂ ̂ ( )( ) ( )

Step Seven (7): Revised simplex table is shown as

̂ ̂ ̂ Ratio
̂
̂

⁄
⁄

is the key element and therefore , leaves the basis.

Step Eight (8):

̂ ( )

Step Nine (9): Go to step Five (5)

( )

, the most negative, enters the basis

IJMSRT25NOV029 www.ijmsrt.com 75
DOI: https://doi.org/10.5281/zenodo.17658199
Volume-3-Issue-11-November,2025 International Journal of Modern Science and Research Technology
ISSN NO-2584-2706

̂ ̂ ̂ ( )

( ) ( )

̂ ̂ ̂ ( ) ( )

( )

̂ ̂ ̂ ̂
Ratio ⁄̂ , ̂

( )

leaves the basis ( ) is the key element. and other elements in the key column to be
zero.
Next we make the key element to be unity

̂ ( )
⁄

( )

Since all , the current feasible solution is optimal

̂ ̂ ̂ ( )( ) ( )

the optimal solution is given by , , and

Example 2
Use the revised simplex method to solve Subject to:
the following LPP

Solution

IJMSRT25NOV029 www.ijmsrt.com 76
DOI: https://doi.org/10.5281/zenodo.17658199
Volume-3-Issue-11-November,2025 International Journal of Modern Science and Research Technology
ISSN NO-2584-2706

Step One (1): Introduce the slack variables into its standard form
and convert the given problem

Subject to:

Step Two (2): The initial basis feasible solution is

Step Three (3):

( ), ( ),

̂ ( ) ( ),̂ ( ) ( )

Step Four (4):

=( ) and ( )

(Coefficient of basis in the objective function)

( )

̂ ( ) ( )

Step Five (5): The net evaluations are given by

( )

Thus, the most negative value is , and enters the basis

Step Six (6):

IJMSRT25NOV029 www.ijmsrt.com 77
DOI: https://doi.org/10.5281/zenodo.17658199
Volume-3-Issue-11-November,2025 International Journal of Modern Science and Research Technology
ISSN NO-2584-2706

̂ ̂ ̂ ( )( ) ( )

̂ ̂ ̂ ( )( ) ( )

Step Seven (7): Revised simplex table is shown as

̂ ̂ ̂ Ratio
̂
̂

⁄
⁄
⁄

, leaves the basis.

Step Eight (8): First iteration

Drop and introduce . Convert the leading element into ‘ ’ and the remaining element as
zero in the key column

̂ ( )

( )
( )

The last row of ̂

Compute ̂

( )

Since all , we have reached the optimal solution

IJMSRT25NOV029 www.ijmsrt.com 78
DOI: https://doi.org/10.5281/zenodo.17658199
Volume-3-Issue-11-November,2025 International Journal of Modern Science and Research Technology
ISSN NO-2584-2706

̂ ̂ ̂ ( )

( ) ( )

the optimal solution is given by , , and

5.Discussion computational solvers and decision-support

The Revised Simplex Method stands out as systems.
an efficient computational alternative to the Moreover, the algorithm’s modular structure
classical simplex approach by limiting enhances its scalability and maintainability,
updates to only essential components of the making it a foundation for advanced
tableau. Rather than recalculating the entire optimization techniques such as the Dual
tableau at each iteration, the method focuses Revised Simplex Method, Interior-Point
on updating the basis inverse and relevant Algorithms, and Sparse Matrix Variants.
vectors, significantly reducing both memory This highlights its enduring importance in
consumption and arithmetic operations. This both theoretical research and applied
makes it particularly suitable for solving operations research, where efficiency and
large-scale and sparse linear programming clarity of computation remain essential.
problems where computational cost is a
major concern. 6.Contribution of the Study
The results from the two illustrative This paper contributes to the body of
examples clearly demonstrate the knowledge in optimization and linear
algorithm’s systematic nature and programming by presenting a clearly
operational efficiency. Each pivot iteration structured and pedagogically enhanced
refines the feasible region by updating basic exposition of the Revised Simplex Method.
and non-basic variables while ensuring that Unlike most existing works that emphasize
feasibility and optimality conditions are theoretical derivations or algorithmic
preserved. The smooth progression from an comparisons, this study focuses on
initial feasible solution to the optimal one simplifying and clarifying the computational
highlights the precision and consistency of process for learners, instructors, and
the Revised Simplex approach. practitioners.
A key advantage observed is the method’s The work’s foremost contribution lies in its
adaptability to computer implementation. Its step-by-step procedural framework, which
reliance on structured matrix algebra aligns divides the Revised Simplex Method into
well with modern programming nine distinct and logically connected stages.
environments such as Python, MATLAB, This structured presentation improves
and R, where matrix operations can be conceptual understanding and practical
optimized using built-in linear algebra application, making the method more
libraries. Consequently, the Revised accessible for instructional use and manual
Simplex Method is not only pedagogically computation.
valuable for classroom demonstrations but Another contribution is the inclusion of
also highly relevant for developing comprehensive numerical examples that
illustrate the transition from theoretical

IJMSRT25NOV029 www.ijmsrt.com 79
DOI: https://doi.org/10.5281/zenodo.17658199
Volume-3-Issue-11-November,2025 International Journal of Modern Science and Research Technology
ISSN NO-2584-2706

formulation to optimal solutions. These such as network flows, transportation, and

examples serve as effective learning tools, resource allocation. These directions would
bridging the gap between mathematical not only strengthen its practical relevance
modeling and implementation. but also reinforce its central role in the
Additionally, the paper highlights the advancement of modern optimization theory
algorithm’s compatibility with modern and applications.
computational environments such as Python,
MATLAB, and R, emphasizing its potential References
for integration into educational and 1. Openstax.(2023).Contemporary
decision-support software. This aligns the Mathematics–sectiononLinear
classical Revised Simplex Method with Programming. Retrieved from
contemporary computational needs and https://openstax.org/books/contemporary-
promotes its ongoing relevance in research, mathematics/pages/5-11-linear-
industry, and academic instruction. programming
2. Vanderbei, R. J. (2020). Linear
7.Conclusion Programming: Foundations and Extensions
This study presented a clear, structured, and (5th ed.). Springer.
pedagogically focused exposition of the 3. Stanimirovic, I. (2024). Advances in
Revised Simplex Method for solving linear Optimization and Linear Programming.
programming problems. By detailing each Apple Academic Press.
computational step, the paper bridges the 4. Taylor & Francis. (n.d.). The Revised
gap between theoretical formulation and Simplex Method. In Introduction to Linear
practical application, providing both learners Programming. Taylor & Francis Group.
and practitioners with a transparent view of 5. Bazaraa, M. S., Jarvis, J. J., & Sherali, H.
the algorithm’s mechanics. D. (2010). Linear Programming and
The method’s efficiency arises from its Network Flows (4th ed.). Wiley.
selective matrix updates, which minimize 6. Bertsimas, D., & Tsitsiklis, J. N. (1997).
redundant computations while maintaining Introduction to Linear Optimization.
feasibility and optimality. The worked Athena Scientific.
examples demonstrated the algorithm’s 7. Kumar, V. (2013). Operations Research. S.
logical progression and confirmed its K. Kataria & Sons, pp. 22–23.
capacity to yield accurate solutions through How to Cite this Paper: Danladi, M.,
systematic pivot operations. Damulak, G. P., Wang, F. E., & Oku, P.
Beyond its instructional value, the Revised (2025). A Clear Step-by-Step Revised
Simplex Method remains a powerful Simplex Method. International Journal of
computational tool for real-world Advanced Networking and Applications,
optimization. Its structure lends itself 17(5), 1–10.
naturally to computer implementation using
modern numerical platforms, enabling
efficient solutions for high-dimensional and
data-intensive problems.
Future research can extend this work by
integrating the Revised Simplex Method
into educational and industrial software,
exploring its dual or parametric variants, and
applying it to complex optimization domains

IJMSRT25NOV029 www.ijmsrt.com 80
DOI: https://doi.org/10.5281/zenodo.17658199