Generic Process That Is Followed To Solve A Linear Programming Problem Via Simplex Method

Muhammad Asiful Hoque
ID: 17241058
Question: Write a step by step description of the practical implications of linear programming and how
one can solve such problems using the simplex method. Please be sure to give the step by step generic
process that is followed to solve a linear programming problem via simplex method.
Answer: Linear programming is used to obtain optimal solutions for operations research. Using linear
programming allows researchers to find the best, most economical solution to a problem within all of its
limitations, or constraints. Many fields use linear programming techniques to make their processes more
efficient.
1. Applications in Energy Industry:
Modern energy grid systems incorporate not only traditional electrical systems, but also
renewables such as wind and solar photovoltaics. In order to optimize the electric load
requirements, generators, transmission and distribution lines, and storage must be taken into
account. At the same time, costs must remain sustainable for profits. Linear programming
provides a method to optimize the electric power system design. Linear programming can be used
to optimize load-matching or to optimize cost, providing a valuable tool to the energy industry.
2. Applications in retail shop:
Linear programming is also used in organized retail for shelf space optimization. Optimization is
aggressively used in stores like Walmart, Hyper-city, Reliance, Big Bazaar, etc. The products in
the store are placed strategically keeping in mind the customer shopping pattern. The objective is
to make it easy for a customer to locate & select the right products. This is subject to constraints
like limited shelf space, a variety of products, etc.
3. Applications in manufacturing industries:
Manufacturing industries use linear programming for analyzing their supply chain operations.
Their motive is to maximize efficiency with minimum operation cost. As per the
recommendations from the linear programming model, the manufacturer can reconfigure their
storage layout, adjust their workforce and reduce the bottlenecks.
4. Applications in Delivery Routes:
Optimization is also used for optimizing Delivery Routes. This is an extension of the popular
traveling salesman problem. The service industry uses optimization for finding the best route for
multiple salesmen traveling to multiple cities. Companies like FedEx, Amazon, etc uses linear
programming. The objective is to minimize the operation cost and time.
Generic process that is followed to solve a linear programming problem via simplex method:
Step 1: Identify Decision Variables
Let , , represent the total number of ads for television, newspaper, and radio respectively.
Step 2: Objective Function
The objective of the company is to maximize the audience. The objective function is given by:
Muhammad Asiful Hoque
ID: 17241058
Step 3: Write down the constraints
Now, I will mention each constraint one by one.

It is clearly given that we have a budget constraint. The total budget which can be allocated is $18,200. And
the individual costs per television, newspaper and radio advertisement is $2000, $600 and $300
respectively. This can be represented by the equation,
For a newspaper advertisement, there is an upper cap on the number of advertisements to 10. My first
constraints are,
The next constraint is the number of advertisements on television. The company wants at least 10% of the
total advertisements to be on television. So, it can be represented as:
The last constraint is the number of advertisements on the radio cannot be more than half of the total number
of advertisements. It can be represented as
Now, I have formulated my linear programming problem. We are using the simplex method to solve this.
I will take you through the simplex method one by one.
To reiterate all the constraints are as follows. I have simplified the last two equations to bring them in
standard form.
We have a total of 4 equations. To balance out each equation, I am introducing 4 slack variables,
and .
So our equations are as follows:

Generic Process That Is Followed To Solve A Linear Programming Problem Via Simplex Method

Uploaded by

Copyright:

Available Formats

Generic Process That Is Followed To Solve A Linear Programming Problem Via Simplex Method

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Generic Process That Is Followed To Solve A Linear Programming Problem Via Simplex Method

Uploaded by

Copyright:

Available Formats

Muhammad Asiful Hoque

Step 1: Identify Decision Variables

Step 2: Objective Function

Step 3: Write down the constraints

Now, I will mention each constraint one by one.

So our equations are as follows:

You might also like