Linear programming. Foundations and extensions

Publication date: 16 October 2001

Published in: International Series in Operations Research \& Management Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Linear programming (90C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items

The learnability of voting rules, A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints, Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods, A simple direct cosine simplex algorithm, The interior-point revolution in optimization: History, recent developments, and lasting consequences, A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines, Implementing the simplex method as a cutting-plane method, with a view to regularization, Some inverse optimization problems on network, Equality detection for linear arithmetic constraints, On the simplex algorithm initializing, Model approximation for batch flow shop scheduling with fixed batch sizes, Constraint consensus methods for finding interior feasible points in second-order cones, Vanishing Price of Decentralization in Large Coordinative Nonconvex Optimization, A fast method for a class of one-stage bounded variables and single constrained linear programming problems, Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors, Fast \(L_1^kC^k\) polynomial spline interpolation algorithm with shape-preserving properties, A Newton-Type Globally Convergent Interior-Point Method To Solve Multi-Objective Optimization Problems, Assigning real-time tasks to heterogeneous processors by applying ant colony optimization, Computational Cam clay plasticity using second-order cone programming, Type-based amortized resource analysis with integers and arrays, A two-phase support method for solving linear programs: numerical experiments, The final NETLIB-LP results, LP approach to exponential stabilization of singular linear positive time-delay systems via memory state feedback, Minimal positive stencils in meshfree finite difference methods for the Poisson equation, Improved linear programming methods for checking avoiding sure loss, Steplength selection in interior-point methods for quadratic programming, Difference sets and positive exponential sums. I: General properties, Legendre transform and applications to finite and infinite optimization, George B. Dantzig and systems optimization, A penalized method for multivariate concave least squares with application to productivity analysis, Energy management optimization of a smart wind power plant comparing heuristic and linear programming methods, Computing \(c\)-optimal experimental designs using the simplex method of linear programming, The fractional minimal cost flow problem on network, Quadratic optimization in the problems of active control of sound, An interior-point algorithm for elastoplasticity, Noncooperative foundations of the nucleolus in majority games, The diameters of network-flow polytopes satisfy the Hirsch conjecture, Efficient Interpolant Generation in Satisfiability Modulo Theories, A semidefinite programming approach for solving multiobjective linear programming, On the fractional chromatic number of monotone self-dual Boolean functions, Another look at linear programming for feature selection via methods of regularization, Quantile regression with monotonicity restrictions using P-splines and the L1-norm, LPbook, Unnamed Item, Minimum norm interpolation in the ℓ1(ℕ) space, Moment growth bounds on continuous time Markov processes on non-negative integer lattices, Stability analysis of a class of nonlinear positive switched systems with delays, Finite-time stability and stabilisation of singular discrete-time linear positive systems with time-varying delay