CRITICAL JOURNAL REVIEW

Compiled By:

 Zulfan (4163312034)

MATHEMATICS DEPARTMENT

FACULTY OF MATHEMATICS AND SCIENCES

STATE UNIVERSITY OF MEDAN

2016
FOREWORD
 Praise the author turning to the presence of God Almighty because with mercy, grace,
and His Taufik and guidance we can resolve this Critical Review Journal well despite the
many flaws in it.

The authors are keen critics of this journal can be useful in order to add insight and
our knowledge of the summary and advantages and weaknesses in the journal is scrutinized.
The author also fully aware that in this paper there is a shortage and far from perfect.
Therefore, the authors hope their criticisms, suggestions and proposals for improvement in
the future, remember nothing is perfect without constructive suggestions.

Hopefully the results of this simple critic incomprehensible to anyone who read it.
Had the results of critics who have compiled this can be useful for our own as well as those
who read it. Previous authors apologize if there are errors of words that are less pleasing and
writer begs criticism and constructive suggestions from readers for improvement in the
future.

Medan,

Author
 JOURNAL IDENTITY

Title : LINEAR PROGRAMMING & OPTIMIZING THE RESOURCES

Kind of Journal : INTERDISCIPLINARY JOURNAL OF CONTEMPORARY

RESEARCH IN BUSINESS

Volume : 4, Number 11

Publication Year : 2013

Author : Maryam Solhi Lord

Samira Mohebbi Bazardeh

Sharareh Khoshnood

Nastaran Mahmoodi

Fatemeh Qowsi Rasht-Abadi

Marjan-ol-Sadat Ojaghzadeh Mohammadi

Reviewer : Putri Indah Lestari

 REVIEW JOURNAL

A. Summary Introduing

Linear programming, or linear optimization, is a mathematical method to achieve the

minimum or maximum value of a linear function on a convex polyhedron. We can
achieve the best outcome (e.g. maximum profit or minimum cost) by using linear
programming under specific settings and constraints. While linear programming is
mainly used in management and economics, it can also be utilized for some engineering
problems.

B. Literature sumarry

Linear Programming was developed as a mathematical pattern during World War II to

plan expenditures and returns in order to reduce costs to the army and increase losses to
the enemy. The method was kept secret until 1947. After the war, many industries began
using it. The founders of linear programming are: George Dantzig who published the
Simplex method in 1947, John von Neumann who developed the theory of duality, and
Leonid Kantorovich - the Russian mathematician who applied similar techniques before
Dantzig and won the Noble Prize in 1957. Leonid Kantorovich showed, for the first time,
in 1979 that the linear-programming problem was solvable in polynomial time, but a
larger theoretical and practical breakthrough in the field came in 1984 when Narendra
Karmarkar introduced a new interior-point method for solving linear-programming
problems.

C. research methods summary

The successful utilization of linear programming in various fields expanded the scientific
use of this technique. There are resource constraints such as labor, time, space, and
technology in every field which have to be optimized. Formulating a linear programming
problem involves optimization elements such as profit or income, or minimizing
elements such as cost, time, and distance. When the problem is expressed, the
management objective is set, and the capability of the linear programming technique for
the given problem is ensured, the next step in a real problem-solving situation is to
express the problem in a mathematical model.
 The elements of a linear programming model are: decision variables, objective function,
and model constraints. The objective function and constraints of a linear programming
model are the decision variables and parameters respectively. The decision variables
include mathematical symbols which represent the level of activity of any organization.
The objective function is a mathematical linear relationship which expresses the
objective of the organization in terms of decision variables. The objective function is
always set as ―maximizing‖ or ―minimizing‖. The model constraints also express the
linear relation among the decision variables. The constraints are imposed on the
organization by the operational environment, and are often due to limited resources or
the organization’s ―internal policies.

D. Result summary

To solve a linear programming problem for each product (or variable), two axes
(dimensions) are required. Therefore, a graph for a 2-dimensional model is easy. But for
solving linear programming problems with more dimensions (variables), we have to use
Simplex method and often computer software. Then, it would be better to solve such
problems by graphical method. Although drawing lines for model constraints limits the
region of possible solutions, but still there are many more solutions left. The final
optimal value (solution) for the linear programming model occurs at one of the vertices
of the region determined by the constraints. Combinations of x1 and x2 which lie in one
of these vertices are called ―the basic solution‖. There are only two more steps left for a
graphical method as following:

1. Find the vertices of the region.

2. Test the objective function at each of the vertices (profit obtained from selling a
product). The vertex that has the maximum value is the optimal solution.

Linear programming problems with 2 variables (dimensions) can be easily solved

graphically, but solving more complicated models (with 3 or more variables) could be
done by Simplex method (manually or using a computer). The table in which all figures
on the first line are negative, contains the final optimized solution. In addition to the final
solution, other useful information such as shadow prices will be provided in the final
Simplex table. Also, the allowed range of profit coefficient and limited capacities can be
computed using the data in Simplex tables. The allowed range means that if the
coefficients are altered within the defined range, the final solution will not change in
 terms of various combinations. Therefore, it may be said that estimating the coefficients
which have a rather wide allowed range, is less risky. The shadow prices represent the
value of objective function (profit or cost) for any increased unit of each of the limited
resources.

E. Conclusion Summary

This problem was solved by Leonid Khachiyan in 1979 by introducing the Ellipsoid
method. This method was polynomial time. The algorithm of Khachiyan was not
practically a break-through, as the simple method was more efficient for all but specially
constructed linear programs. However, the theoretical aspect of Kachiyan's algorithm
was of landmark importance. Khachiyan's algorithm inspired new lines of research to
solve the linear programs called ―Interior-point method‖. The interior-point methods
move through the interior of the feasible region towards the optimal point.
F. Advantages Journal

 The words in this journal were written by a solid, clear, and have a broad
meaning.
 The journal has an identity of complete data from abstract, volume, number, and
date of manufacture.
 The research method of this journal is easily understood by the reader.

G. Weakness Journal

 The discussion in this journal is too short.

 It is recommended that the application of permutation and combination principles
be incorporated into the discussion.
 CLOSING

A. Conclusion

I think this journal greatly adds readers' insights, especially mathematicians who want
to add insight on the application of mathematics in the life of the day. One of which is
application of Linear programming in management and economics.

B. Advise

Realizing that the author is still far from perfect, the future author will focus and
details in describing critics of the book on the resources that are certainly more that can
be accounted.

The author hopes that readers want to critics on the books, such as fiction books,
novels, scientific papers, etc., because then we can understand the contents of the book
more closely.