- Book Chapter
1
- 10.1016/b978-0-12-821126-7.00002-4
Chapter two - Linear programming
- Jan 01, 2020
- Fundamentals of Optimization Techniques with Algorithms
- Sukanta Nayak
Chapter two - Linear programming
Abstract: Linear Programming (LPP) is a mathematical method used to optimize resource allocation systems with linear relationships, it aims to maximize or minimize a linear objective function while adhering to linear constraints. This paper showcase how to optimize linear programming problems through the simplex and graphical methods. The excel environment facilitates efficient modeling and solution generation. The simplex method is executed step – by – step, showcasing its versatility, while the graphical method provides visual insights. The solver add in automates the optimization process, adjusting decision variables within constraints. Comparative analysis reveals insights into the strengths of both the methods used in the process of the study. This research contributes to practical applications of LP, emphasizing the significance of excel and solver for real – world problem solving
Chapter two - Linear programming
Chapter two - Linear programming
A brief history of linear and mixed-integer programming computation
For many of us, modern-day linear programming (LP) started with the work of George Dantzig in 1947. However, it must be said that many other scientists have also made seminal contributions to the subject, and some would argue that the origins of LP predate Dantzig’s contribution. It is matter open to debate [36]. However, what is not open to debate is Dantzig’s key contribution to LP computation. In contrast to the economists of his time, Dantzig viewed LP not just as a qualitative tool in the analysis of economic phenomena, but as a method that could be used to compute actual answers to specific real-world problems. Consistent with that view, he proposed an algorithm for solving LPs, the simplex algorithm [12]. To this day the simplex algorithm remains a primary computational tool in linear and mixed-integer programming (MIP). In [11] it is reported that the first application of Dantzig’s simplex algorithm to the solution of a non-trivial LP was Laderman’s solution of a 21 constraint, 77 variable instance of the classical Stigler Diet Problem [41]. It is reported that the total computation time was 120 man-days! The first computer implementation of an at-least modestly general version of the simplex algorithm is reported to have been on the SEAC computer at the then National Bureau of Standards [25]. (There were apparently some slightly earlier implementations for dealing with models that were “triangular”, that is, where all the linear systems could be solved by simple addition and subtraction.) Orchard-Hays [35] reports that several small instances having as many as 10 constraints and 20 variables were solved with this implementation. The first systematic development of computer codes for the simplex algorithm began very shortly thereafter at the RAND Corporation in Santa Monica, California. Dantzig’s initial LP work occurred at the Air Force following
Read moreDesign of large scale applications of secure multiparty computation : secure linear programming
Secure multiparty computation is a basic concept of growing interest in modern cryptography. It allows a set of mutually distrusting parties to perform a computation on their private information in such a way that as little as possible is revealed about each private input. The early results of multiparty computation have only theoretical signi??cance since they are not able to solve computationally complex functions in a reasonable amount of time. Nowadays, e??ciency of secure multiparty computation is an important topic of cryptographic research. As a case study we apply multiparty computation to solve the problem of secure linear programming. The results enable, for example in the context of the EU-FP7 project SecureSCM, collaborative supply chain management. Collaborative supply chain management is about the optimization of the supply and demand con??guration of a supply chain. In order to optimize the total bene??t of the entire chain, parties should collaborate by pooling their sensitive data. With the focus on e??ciency we design protocols that securely solve any linear program using the simplex algorithm. The simplex algorithm is well studied and there are many variants of the simplex algorithm providing a simple and e??cient solution to solving linear programs in practice. However, the cryptographic layer on top of any variant of the simplex algorithm imposes restrictions and new complexity measures. For example, hiding the number of iterations of the simplex algorithm has the consequence that the secure implementations have a worst case number of iterations. Then, since the simplex algorithm has exponentially many iterations in the worst case, the secure implementations have exponentially many iterations in all cases. To give a basis for understanding the restrictions, we review the basic theory behind the simplex algorithm and we provide a set of cryptographic building blocks used to implement secure protocols evaluating basic variants of the simplex algorithm. We show how to balance between privacy and e??ciency; some protocols reveal data about the internal state of the simplex algorithm, such as the number of iterations, in order to improve the expected running times. For the sake of simplicity and e??ciency, the protocols are based on Shamir's secret sharing scheme. We combine and use the results from the literature on secure random number generation, secure circuit evaluation, secure comparison, and secret indexing to construct e??cient building blocks for secure simplex. The solutions for secure linear programming in this thesis can be split into two categories. On the one hand, some protocols evaluate the classical variants of the simplex algorithm in which numbers are truncated, while the other protocols evaluate the variants of the simplex algorithms in which truncation is avoided. On the other hand, the protocols can be separated by the size of the tableaus. Theoretically there is no clear winner that has both the best security properties and the best performance.
Read moreElementary Linear Programming with Applications
Elementary Linear Programming with Applications
РОЗВ’ЯЗАННЯ ЗАДАЧ ОПТИМІЗАЦІЇ В ЕНЕРГЕТИЦІ ЗА ДОПОМОГОЮ ГЕНЕТИЧНОГО АЛГОРИТМУ
The article discusses the application of genetic algorithms in the field of energy optimization. Linear programming is commonly used for optimization problems in energy systems. Linear programming is a mathematical optimization method that seeks the optimal solution under constraints, where all constraints and the objective function are linear functions. In the realm of artificial intelligence,genetic algorithms are employed for optimization tasks. genetic algorithms mimic natural evolution processes, including selection, crossover, mutation, and adaptation, to solve optimization and search problems. The article outlines the process of a genetic algorithm, starting with the formation of an initial population and proceeding through selection, crossover, mutation, and evaluation. This cycle repeats until an optimal solution is achieved. Advantages of genetic algorithms include their ability to handle complex solution spaces, find global optima, adapt to changing conditions, optimize multi-objective functions, and work with non-linear and non-differentiable objective functions. However, they may require significant computational resources and parameter tuning. The article then presents a case study of applying a genetic algorithm to optimize the allocation of a power load in an energy system. The mathematical model is developed, and the simplex method is initially used for solution. Subsequently, a Python program for genetic algorithm implementation is provided. The algorithm's efficiency and convergence are demonstrated through a graphical representation of the optimization process. In conclusion, the article highlights the effectiveness of genetic algorithms in energy optimization, showcasing their rapid convergence and ability to find near-optimal solutions in complex scenarios.
Read moreMinimalisasi Biaya Produksi Sendal Menggunakan Linear Programming:

 The simplex method is a method used to solve linear programming problems with repeated calculations (iterations) that are performed many times until an optimal solution is reached. In solving linear programming problems, it is necessary to determine the constraints and inequalities contained in linear programming. The simplex method can solve linear programming problems involving many inequalities and many variables. Therefore, the purpose of this research is to optimize the production cost of sandals in the Diona Shoes Home Industry. The steps taken to optimize the production cost of sandals include: observing and collecting data, then making a mathematical model, then optimizing production results using the simplex method (iteration), and finally optimizing production results with the Lindo 16.0 software tool.
 Keywords: Diona Shoes, Linear Programming, Simplex Method, Lindo 16.0.
Read moreMore on Simplex
In the previous chapter, the basics of the simplex and revised simplex algorithms were developed. Degeneracy and convergence issues were addressed. In this chapter we continue with several enhancements to the basic algorithm and related issues. In Section 6.2 we continue the development of sensitivity analysis which was first discussed in Chapters 2 and 3. We show that an analysis of the simplex tableau provides dual variable values, reduced costs and range analysis for the right hand side and objective function, but the simplex algorithm does not provide results which are as reliable as those obtained using projection and inverse projection. In Section 6.3 we develop the dual simplex algorithm. This is the simplex algorithm applied to the dual problem but using the primal simplex tableau. In our earlier development of the simplex algorithm we assumed that all variables had a lower bound of zero and an upper bound of oo. In Section 6.4 we show how to incorporate variables with arbitrary lower and upper bounds into the simplex algorithm. The simplex algorithm requires an initial feasible basis. In Section 6.5 we show how to find an initial basic feasible solution. In Step 3 of the simplex algorithm it is necessary to select a variable to enter the basis. In Section 6.6 we describe several methods for selecting the entering variable. In Section 6.7 we discuss other numerical issues such as tolerances, the minimum ratio test and scaling. Concluding remarks are given in Section 6.8. Exercises are provided in Section 6.9. One topic not covered in this chapter is preprocessing. By preprocessing we mean analyzing the problem prior to solution in order to discover obvious redundancies, tighter variable bounds, eliminate variables and constraints, etc. This is very important in reducing the solution time for solving linear programs. Our discussion of preprocessing linear programs is postponed until Chapter 15.
Read moreProblem Solving Skills of Mathematics Education Students with Lack Number Sense Ability
Problem-solving in mathematics is a fundamental skill that must be mastered by individuals. However, previous research indicates that students' problem-solving abilities tend to be moderate to low. Many factors contribute to this, including the factor of number sense ability. The objective of this study is to describe how number sense and problem-solving skills are used by mathematics education students with low number sense ability in solving linear programming problems using the simplex method. This research is qualitative descriptive involving 36 third-year mathematics education students as participants. Subjects were selected using purposive sampling technique based on a number sense ability test to identify those with low number sense ability. Participants were given an advanced test involving linear programming problems solved using the simplex method. The results indicate that mathematics education students with low number sense ability struggle to solve problems accurately. Stages of problem-solving that were not performed effectively included gathering information, planning, and implementing the plan. Furthermore, students did not engage in the reviewing stage. Moreover, students were not flexible in manipulating numbers, especially when dealing with large numbers. As a result, more time was required for computations, and the iteration process in the simplex method could not be effectively completed. Keywords: linear programming, number sense, number sense ability, problem solving, simplex method. DOI: https://dx.doi.org/10.23960/jpmipa/v25i1.pp103-115
Read moreTowards a practical parallelisation of the simplex method
The simplex method is frequently the most efficient method of solving linear programming (LP) problems. This paper reviews previous attempts to parallelise the simplex method in relation to efficient serial simplex techniques and the nature of practical LP problems. For the major challenge of solving general large sparse LP problems, there has been no parallelisation of the simplex method that offers significantly improved performance over a good serial implementation. However, there has been some success in developing parallel solvers for LPs that are dense or have particular structural properties. As an outcome of the review, this paper identifies scope for future work towards the goal of developing parallel implementations of the simplex method that are of practical value.
Read moreParametric Approach to Some Linearly Constrained Optimization Problems Using Simplex-Type Methods
This paper establishes a framework for solving some optimization problems with linear constraints using simplex-type methods. The problems include those found in linear programs, linear fractional programs, and generalized linear fractional programs. In this study, these problems refer to a standard form of minimizing a single parameter subject to parameterized linear equations. Based on the analysis of parameterized basis-based solutions, a unified simplex-type approach is proposed. The adaptability of the parameterized model and that of the solution procedure are discussed. In particular, the proposed algorithm can prevent cycling when compared with the conventional simplex method used for solving linear programs.
Read moreThe Complexity of the Simplex Method
The simplex method is a well-studied and widely-used pivoting method for solving linear programs. When Dantzig originally formulated the simplex method, he gave a natural pivot rule that pivots into the basis a variable with the most violated reduced cost. In their seminal work, Klee and Minty showed that this pivot rule takes exponential time in the worst case. We prove two main results on the simplex method. Firstly, we show that it is PSPACE-complete to find the solution that is computed by the simplex method using Dantzig's pivot rule. Secondly, we prove that deciding whether Dantzig's rule ever chooses a specific variable to enter the basis is PSPACE-complete. We use the known connection between Markov decision processes (MDPs) and linear programming, and an equivalence between Dantzig's pivot rule and a natural variant of policy iteration for average-reward MDPs. We construct MDPs and then show PSPACE-completeness results for single-switch policy iteration, which in turn imply our main results for the simplex method.
Read moreA global pricing extension of the simplex method
We introduce the use of a global, nonlinear price function in linear programming and the simplex method. The usual, linear price function of this method captures the objective’s behaviour over the cone of directions defined by the nonbasic columns, whereas the global price function adds information about the topology of the whole feasible set. This is achieved by using an exterior penalty function. Further, degeneracy is effectively handled through explicit degeneracy-breaking constraints. The use of the global price function leads to a pricing problem that yields an improving, non-edge feasible direction, which is converted to an auxiliary variable to be used in the simplex method. Preliminary computational results with nondegenerate and highly degenerate linear programs show that the introduction of a global price function in the simplex method, and degeneracy-breaking constraints if needed, may significantly enhance its performance.
Read morePolynomial Methods in Linear Programming
As we have shown, the simplex method refers to the so-called finite methods which allow one to find a solution for any problem of linear programming or to prove its unsolvability performing a finite number of elementary operations (addition, subtraction, multiplication, division, comparison of two real numbers). It stands to reason that the number of operations depends on the dimension (n, m) of the problem (n is the number of variables, m is the number of equality and inequality constraints). The practice of solving linear programming problems has shown that the simplex method and its modifications are very effective. It is accepted as a fact that in the majority of linear programming problems the number of elementary operations which are necessary for their solution is of the order O(n 2 m + m 2 n) [1, 91]. Here and in the sequel we denote by O(a) the quantities for which |O(a)| ≤ C(a), where C is a positive constant independent of a. We have found out that there exist “poor” linear programming problems in which the amount of elementary operations required for their solution by the simplex method is estimated by the number which exponentially depends on n and m.
Read moreNew results on the average behavior of simplex algorithms
It has been a challenge for mathematicians to theoreti- cally confirm the extremely good performance of simplex algorithms for linear programming. We have confirmed that a certain variant of the simplex method solves problems of order m x n in an expected num- ber of steps which is bounded between two quadratic functions of the smaller of the problem. Our probabilistic assumptions are rather weak. 1. Introduction. We consider the linear programming problem of order m x n in the form: Maximize cTx over all x >_ 0 in Rn such that Ax 5 6, where A E Rmxn. It has been observed that the simplex algorithms for linear programming, developed by George Dantzig (Dl, work extremely well. A central question in the field of analysis of algorithms is to estimate the expected number of steps that these algorithms perform relative to different probability distributions of inputs. Some background is given in 52. In (AM1 and T) we consider a variant of the simplex method called the lexicographic self-dual method. We find that the expected number of steps of this variant, relative to a rather weak probabilistic model, is only O((min(m, n))2). This is the first polynomial average-case upper bound for a simplex algorithm which is capable of solving any linear programming problem. The first two authors (AM21 have also determined a quadratic lower bound, so the behavior of this variant is indeed quadratic, whereas it has been conjectured that other variants take a linear expected number of steps. With various choices of the starting point, this variant can simulate different constraint-by-constraint and variable dimension algorithms, as well as combinations thereof (Me2). Adler, Karp and Shamir (AKS) provide a different proof of similar upper bound for a certain class of constraint-by-constraint algorithms. It follows . from (Me21 that their variant can also be simulated by the self-dual algorithm with an appropriate starting point.
Read moreKajian Penerapan Program Linear Multi Objektif Fuzzy Interaktif Pada Keputusan Perencanaan Transportasi
In this paper, we discusses the problem that involving the conflict fuzzy multi-objective in transportation planning which is one of special case in multi-objective linear programming. To find the simultaneously optimal solution of the problem, we use the Interactive Fuzzy Multi-Objective Linear Programming (IFMOLP) method. This method can reduce the fuzzy multi-objective linear programming problem into deterministic single objective linear programming which can be solved using simplex method. Beside that , with IFMOLP method, decision maker (DM) can establish interactively the goal from the objective function to produce the pareto optimal solution so that.
Read more