- Single Book
96
- 10.1016/b978-0-12-417910-3.x5000-1
Elementary Linear Programming with Applications
- Jan 01, 1995
- Bernard Kolman + 1 more +1
Elementary Linear Programming with Applications
3 - Further Topics in Linear Programming
Elementary Linear Programming with Applications
Elementary Linear Programming with Applications
LAD and Linear Programming
In this chapter we discuss the linear programming (LP) problem and its connection with LAD fitting. To fix the language and notation let there be given vectors c ∈ Rn, b ∈ Rm and an m by n matrix A. The vector c determines a linear functional f(x) = on Rn and A and b determine m linear inequalities Ax ≤ b. The LP problem in standard form is to $$ \begin{array}{*{20}{c}} {\max imize{\kern 1pt} f\left( x \right)} {subject{\kern 1pt} to{\kern 1pt} A{\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{x}} \leqslant b} {{\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{x}} \geqslant 0} \end{array} $$ (1)
Read moreDuality Principle and Dual Simplex Method
Duality is an essential part of LP theory. It is related to the special relationship between one LP problem and another, both of which involve the same data (A, b, c), but positioned differently (except for the self-duality, see below). The former is referred to as primal problem, and the latter as dual problem. Based on duality, once a primal problem is solved, so is the dual problem, and vice versa. This chapter is devoted to such topics as the relationship between their feasible regions as well as optimal solutions, optimality condition, dual simplex algorithm in tableau form and in revised form, shadow price, and dual elimination. Before making notes on the duality in the final section, we introduce a special bilevel LP problem together with a related approach to intercepting the optimal set.
Read moreEfficient algorithms for buffer space allocation
This paper describes efficient algorithms for determining how buffer space should be allocated in a flow line. We analyze two problems: a primal problem, which minimizes total buffer space subject to a production rate constraint; and a dual problem, which maximizes production rate subject to a total buffer space constraint. The dual problem is solved by means of a gradient method, and the primal problem is solved using the dual solution. Numerical results are presented. Profit optimization problems are natural generalizations of the primal and dual problems, and we show how they can be solved using essentially the same algorithms.
Read moreFinding all solutions of weakly nonlinear equations using the dual simplex method
Recently, efficient algorithms have been proposed for finding all solutions of nonlinear equations using linear programming (LP). These algorithms are based on a simple test (termed the LP test) for nonexistence of a solution to a system of nonlinear equations in a given region. In the LP test, a system of nonlinear equations is transformed into an LP problem by surrounding component nonlinear functions by rectangles or right‐angled triangles. In this paper, an efficient algorithm is proposed for finding all solutions of weakly nonlinear equations, where component nonlinear functions are surrounded by parallelograms and then the dual simplex method is applied to the LP problem. Numerical examples are given to confirm the effectiveness of the proposed algorithm. © 2006 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 89(7): 1–7, 2006; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20220
Read moreFeasibility and solvability of Lyapunov-type linear programming over symmetric cones
In this paper, we consider the Lyapunov-type linear programming and its dual over symmetric cones. By introducing and characterizing the generalized inverse of Lyapunov operator in Euclidean Jordan algebras, we establish two kinds of Lyapunov-type Farkas’ lemmas to exhibit feasibilities of the corresponding primal and dual programming problems, respectively. As one of the main results, we show that the feasibilities of the primal and dual problems lead to the solvability of the primal problem and zero duality gap under some mild condition. In this case, we obtain that any solution to the pair of primal and dual problems is equivalent to the solution of the corresponding KKT system.
Read moreA Variant of the Dual Simplex Method for a Linear Semidefinite Programming Problem
A linear semidefinite programming problem in the standard statement is considered, and a variant of the dual simplex method is proposed for its solution. This variant generalizes the corresponding method used for linear programming problems. The transfer from an extreme point of the feasible set to another extreme point is described. The convergence of the method is proved.
Read moreOn quadratic convergence of the $$O\left( {\sqrt {nL} } \right)$$ -iteration homogeneous and self‐duallinear programming algorithm
In this paper, we show that Ye‐Todd‐Mizuno's O(\(\sqrt {nL} \)) ‐iteration homogeneous andself‐dual linear programming (LP) algorithm possesses quadratic convergence of the duality gap to zero. In the case of infeasibility, this shows that a homogenizing variable quadratically converges to zero (which proves that at least one of the primal and dual LP problems is infeasible) and implies that the iterates of the (original) LP variable quadratically diverge. Thus, we have established a complete asymptotic convergence result for interior‐point algorithms without any assumption on the LP problem.
Read moreChapter two - Linear programming
Chapter two - Linear programming
Scheduling parallel-machine batch operations to maximize on-time delivery performance
In this paper we study the problem of minimizing total weighted tardiness, a proxy for maximizing on-time delivery performance, on parallel nonidentical batch processing machines. We first formulate the (primal) problem as a nonlinear integer programming model. We then show that the primal problem can be solved exactly by solving a corresponding dual problem with a nonlinear relaxation. Since both the primal and the dual problems are NP-hard, we use genetic algorithms, based on random keys and multiple choice encodings, to heuristically solve them. We find that the genetic algorithms consistently outperform a standard mathematical programming package in terms of solution quality and computation time. We also compare the smaller problem instances to a breadth-first tree search algorithm that gives evidence of the quality of the solutions.
Read moreA neural net algorithm for multidimensional maximum entropy spectrum estimation
A neural net algorithm for multidimensional maximum entropy spectrum estimation
SECOND-ORDER SYMMETRIC DUALITY IN MULTIOBJECTIVE PROGRAMMING OVER CONES
Abstract. In this paper, some omissions in Mishra and Lai [13], havebeen pointed out and their corrective measures have been discussed briefly. 1. IntroductionA pair of primal and dual problems in mathematical programming is calledsymmetric if the dual of the dual is the primal problem. Dorn [6] introducedthe concept of symmetric duality in quadratic programming. His results wereextended to nonlinear convex programming problems by Dantzig et al. [4] andlater by Bazaraa and Goode [3] over arbitrary cones.Mangasarian [11] introduced the concept of second-order duality for non-linear problems. Since then, many authors [1, 2, 7, 9, 15, 16] have workedon second-order symmetric duality. Mishra and Lai [13] studied Mond-Weirtype second-order multiobjective symmetric duality for the following pair ofproblems:(P) K−minimize f(x,y)−12p T ∇ yy f(x,y)psubject to −∇ y (λ T f)(x,y) −∇ yy (λ T f)(x,y) ∈ C ∗2 ,y T [∇ y (λ T f)(x,y) +∇ yy (λ T f)(x,y)] > 0,λ ∈ K ∗ , x ∈ C 1 .(D) K−maximize f(u,v)−12q
Read moreRobust least square semidefinite programming with applications
In this paper, we consider a least square semidefinite programming problem under ellipsoidal data uncertainty. We show that the robustification of this uncertain problem can be reformulated as a semidefinite linear programming problem with an additional second-order cone constraint. We then provide an explicit quantitative sensitivity analysis on how the solution under the robustification depends on the size/shape of the ellipsoidal data uncertainty set. Next, we prove that, under suitable constraint qualifications, the reformulation has zero duality gap with its dual problem, even when the primal problem itself is infeasible. The dual problem is equivalent to minimizing a smooth objective function over the Cartesian product of second-order cones and the Euclidean space, which is easy to project onto. Thus, we propose a simple variant of the spectral projected gradient method (Birgin et al. in SIAM J. Optim. 10:1196---1211, 2000) to solve the dual problem. While it is well-known that any accumulation point of the sequence generated from the algorithm is a dual optimal solution, we show in addition that the dual objective value along the sequence generated converges to a finite value if and only if the primal problem is feasible, again under suitable constraint qualifications. This latter fact leads to a simple certificate for primal infeasibility in situations when the primal feasible set lies in a known compact set. As an application, we consider robust correlation stress testing where data uncertainty arises due to untimely recording of portfolio holdings. In our computational experiments on this particular application, our algorithm performs reasonably well on medium-sized problems for real data when finding the optimal solution (if exists) or identifying primal infeasibility, and usually outperforms the standard interior-point solver SDPT3 in terms of CPU time.
Read moreA polynomial method of approximate centers for linear programming
We present a path-following algorithm for the linear programming problem with a surprisingly simple and elegant proof of its polynomial behaviour. This is done both for the problem in standard form and for its dual problem. We also discuss some implementation strategies.
Read moreA primal-dual method for solving linear programming problems with fuzzy cost coefficients based on linear ranking functions and its applications
There are two important approaches based on linear ranking functions for solving linear programming problems with cost coefficients as an auxiliary problem to obtain a fuzzy solution of fuzzy variable linear programming problem. The first approach uses the primal simplex method that assumes an initial primal feasible basic solution is at hand. The second approach is based on dual simplex method that begins with a basic dual feasible basic solution and proceeds by pivoting through a series of dual basic solutions until the associated complementary primal basic fuzzy solution is feasible. In this paper, we propose a new method called the primal-dual algorithm, which is similar to the dual simplex method and begins with dual feasibility and proceeds to obtain primal feasibility while maintaining complementary slackness. An important difference between the dual simplex method and the primal-dual method is that the primal-dual algorithm does not require a dual feasible solution to be basic. This algorithm is useful specially for solving minimum fuzzy cost flow problem in which finding an initial dual feasible solution turns out to be a trivial task.
Read more