Linear programming: foundations and extensions
From MaRDI portal
Publication:1352549
zbMath0874.90133MaRDI QIDQ1352549
Publication date: 16 February 1997
Published in: International Series in Operations Research \& Management Science (Search for Journal in Brave)
sensitivitystructural optimizationconvex programminginterior-point methodssimplex methodparametric analysisintroduction to linear programming
Convex programming (90C25) Integer programming (90C10) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items (38)
An \(\mathrm S\ell _1 \mathrm{LP}\)-active set approach for feasibility restoration in power systems ⋮ Computational complexity of optimization and crude range testing: A new approach motivated by fuzzy optimization ⋮ Subgradient method with feasible inexact projections for constrained convex optimization problems ⋮ An explicit finite difference approach to the pricing problems of perpetual Bermudan options ⋮ Portfolio selection with uncertain exit time: a robust CVaR approach ⋮ Bayesian stationary state flux balance analysis for a skeletal muscle metabolic model ⋮ An optimal design of collateralized mortgage obligation with PAC-companion structure using dynamic cash reserve ⋮ An interior-point approach for primal block-angular problems ⋮ Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods ⋮ A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming ⋮ On the chaotic behavior of the primal–dual affine–scaling algorithm for linear optimization ⋮ Interior point methods for power flow optimization with security constraints ⋮ Inexact Newton method with feasible inexact projections for solving constrained smooth and nonsmooth equations ⋮ Reluplex: a calculus for reasoning about deep neural networks ⋮ Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation ⋮ Modeling a game into a linear programming problem: the benefits ⋮ Numerical construction of LISS Lyapunov functions under a small-gain condition ⋮ Modified firefly algorithm ⋮ Bayesian flux balance analysis applied to a skeletal muscle metabolic model ⋮ Analysis of programming properties and the row-column generation method for 1-norm support vector machines ⋮ 1-norm support vector novelty detection and its sparseness ⋮ An efficient approach to updating simplex multipliers in the simplex algorithm ⋮ An Embarrassingly Parallel Method for Large-Scale Stochastic Programs ⋮ Management of a hydropower system via convex duality ⋮ Newton's method with feasible inexact projections for solving constrained generalized equations ⋮ A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming ⋮ A parametric simplex algorithm for linear vector optimization problems ⋮ A complete characterization of jump inequalities for the hop-constrained shortest path problem ⋮ Control of linear systems subject to input constraints: A polynomial approach. ⋮ Stratifying High-Dimensional Data Based on Proximity to the Convex Hull Boundary ⋮ Exploiting separability in large-scale linear support vector machine training ⋮ Identification of dynamical systems with a robust interval fuzzy model ⋮ Non-Archimedean zero-sum games ⋮ On the sparseness of 1-norm support vector machines ⋮ Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search ⋮ Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function ⋮ On the Convergence of Mirror Descent beyond Stochastic Convex Programming ⋮ Arbitrary-norm separating plane
This page was built for publication: Linear programming: foundations and extensions
