Using Simplex Algorithms to Solve Delivery Complexities of ABZ Manufacturing Company.

Instructions: The paper should be 5-8 pages.

NOTE: Your work should include Simplex Algorithms. Utilize a Big M Method to provide a graph

The corporate world of manufacturing is often faced with production challenges. One of the major challenges of production is the transportation of products. In this case, I will use a random company ABZ Manufacturing Company. It is a company with four outlets, and one pick-up truck in each outlet. The delivery point is one collection center. To solve the problem of logistics, there is a need for an approach to use Simplex Algorithms to ensure that all deliveries are done on time, and no truck is free.

Additional information: There are around eight variables to be studied in this case study. Because of the complexity, there is a need to use the Simplex Algorithm to solve the variables. The challenge of using LPs is the number of variables in the case study. The Big M Method will also be utilized and provide a graph that shows a solution to the variables, to ensure proper coordination of company logistics. From the study, I hope to gain more knowledge on linear solutions, and at the same time solve a real-life problem using Simplex Algorithms.