Research Updates in Mathematics and Computer Science Vol. 6

  • Home
  • About
  • Books
  • Testimonials
  • Editors
  • Charges
  • Submission
  • Contact
Advanced Search
  1. Home
  2. Books
  3. Research Updates in Mathematics and Computer Science Vol. 6
  4. Chapters


The Simplex Method Approach to Linear Programming Solutions

  • Ghada A. Ahmed

Research Updates in Mathematics and Computer Science Vol. 6, 10 May 2024 , Page 11-32
https://doi.org/10.9734/bpi/rumcs/v6/28 Published: 2024-05-10

  • View Article
  • Review History
  • Cite
  • Statistics
  • Share

Abstract

The SIMPLEX METHOD (SM) is a fundamental technique in the optimization field [1, 2], designed specifically to solve linear programming problems manually with high efficiency and accuracy by understanding limitations, specifying decision variables,creating objective functions and defining the feasible region by using slack variables, tableaus, and pivot variables as a means of finding the optimal solution to an optimization problem.

Keywords:
  • Objective function
  • constraints,entering variables
  • leaving variables
  • optimal solution
  • Review History

How to Cite

Ahmed, G. A. (2024). The Simplex Method Approach to Linear Programming Solutions. Research Updates in Mathematics and Computer Science Vol. 6, 11–32. https://doi.org/10.9734/bpi/rumcs/v6/28
  • ACM
  • ACS
  • APA
  • ABNT
  • Chicago
  • Harvard
  • IEEE
  • MLA
  • Turabian
  • Vancouver
  • Endnote/Zotero/Mendeley (RIS)
  • BibTeX




  • Linkedin
  • Twitter
  • Facebook
  • WhatsApp
  • Telegram

© BP International