Linear programming: foundations and extensions
convex programminginterior-point methodsintroduction to linear programmingparametric analysissensitivitysimplex methodstructural optimization
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Deterministic network models in operations research (90B10) Linear programming (90C05) Integer programming (90C10) Quadratic programming (90C20) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31)
This book presents an introduction to linear programming with extensions to convex analysis, networks and integer, quadratic and convex programming. The simplex method and the interior-point methods play the central role in this modern text. The book consists of four parts. The first part is devoted to the basic theory, the simplex method and duality. It also contains chapters on sensitivity and parametric analysis, implementation issues, convex analysis, game theory and regression. Network-type problems are the topic of the second part including also a chapter on structural optimization. A further main part is devoted to interior-point methods with, for instance, chapters on a path-following method, implementation issues, the affine-scaling method and the homogeneous self-dual method. The fourth part describes extensions to integer, quadratic and convex programming. An appendix gives the relevant parts of computer programs for the primal-dual simplex method and the homogeneous selfdual simplex method.
- Linear programming. Foundations and extensions
- Linear programming. Foundations and extensions
- Linear programming. Foundations and extensions
- Linear programming. Foundations and extensions
- Linear programming. Foundations and extensions.
- scientific article; zbMATH DE number 49168
- scientific article; zbMATH DE number 195106
- Linear Programming
- Linear programming: mathematics, theory and algorithms
- The fundamental theorem of linear programming: extensions and applications
- Arbitrary-norm separating plane
- Management of a hydropower system via convex duality
- Newton's method with feasible inexact projections for solving constrained generalized equations
- Identification of dynamical systems with a robust interval fuzzy model
- On the sparseness of 1-norm support vector machines
- Computational complexity of optimization and crude range testing: A new approach motivated by fuzzy optimization
- Modified firefly algorithm
- Non-Archimedean zero-sum games
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Inexact Newton method with feasible inexact projections for solving constrained smooth and nonsmooth equations
- Bayesian flux balance analysis applied to a skeletal muscle metabolic model
- An \(\mathrm S\ell _1 \mathrm{LP}\)-active set approach for feasibility restoration in power systems
- Bayesian stationary state flux balance analysis for a skeletal muscle metabolic model
- An interior-point approach for primal block-angular problems
- Linear programming computation
- Linear programming
- A survey of some linear programming methods
- scientific article; zbMATH DE number 439946 (Why is no real title available?)
- An embarrassingly parallel method for large-scale stochastic programs
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
- scientific article; zbMATH DE number 4135708 (Why is no real title available?)
- Modeling a game into a linear programming problem: the benefits
- scientific article; zbMATH DE number 5641435 (Why is no real title available?)
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- scientific article; zbMATH DE number 4066613 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- Numerical construction of LISS Lyapunov functions under a small-gain condition
- scientific article; zbMATH DE number 1240224 (Why is no real title available?)
- scientific article; zbMATH DE number 1270599 (Why is no real title available?)
- scientific article; zbMATH DE number 1349588 (Why is no real title available?)
- scientific article; zbMATH DE number 480243 (Why is no real title available?)
- scientific article; zbMATH DE number 1168999 (Why is no real title available?)
- Linear Programming
- scientific article; zbMATH DE number 2061763 (Why is no real title available?)
- 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
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
- Subgradient method with feasible inexact projections for constrained convex optimization problems
- A parametric simplex algorithm for linear vector optimization problems
- A complete characterization of jump inequalities for the hop-constrained shortest path problem
- On the chaotic behavior of the primal-dual affine-scaling algorithm for linear optimization
- Exploiting separability in large-scale linear support vector machine training
- Stratifying high-dimensional data based on proximity to the convex hull boundary
- Linear programming and its application.
- Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function
- On the convergence of mirror descent beyond stochastic convex programming
- Linear programming. Foundations and extensions
- Linear programming. Foundations and extensions
- Control of linear systems subject to input constraints: A polynomial approach.
- Linear optimization and extensions. Problems and solutions
- Linear programming. Foundations and extensions
- Interior point methods for power flow optimization with security constraints
- Introduction to Linear Optimization
- Reluplex: a calculus for reasoning about deep neural networks
- Proof-carrying neuro-symbolic code
- A certified proof checker for deep neural network verification in imandra
- An explicit finite difference approach to the pricing problems of perpetual Bermudan options
- Portfolio selection with uncertain exit time: a robust CVaR approach
- An optimal design of collateralized mortgage obligation with PAC-companion structure using dynamic cash reserve
- Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
- An efficient approach to updating simplex multipliers in the simplex algorithm
- Linear and nonlinear programming.
This page was built for publication: Linear programming: foundations and extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1352549)
