Linear programming. Foundations and extensions
DOI10.1007/978-1-4614-7630-6zbMATH Open1299.90243OpenAlexW4237397831MaRDI QIDQ5891086FDOQ5891086
Authors: Robert J. Vanderbei 
Publication date: 18 July 2013
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-7630-6
Recommendations
linear programmingquadratic programminginterior point methodsinteger programmingconvex programmingnetwork problemssimplex method
Quadratic programming (90C20) Convex programming (90C25) Linear programming (90C05) Deterministic network models in operations research (90B10) Interior-point methods (90C51) Integer programming (90C10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cited In (33)
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
- Title not available (Why is that?)
- Efficient optimization of the reward-risk ratio with polyhedral risk measures
- A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models
- A framework of distributionally robust possibilistic optimization
- Multiple criteria decision-making based on vector similarity measures under the framework of dual hesitant fuzzy sets
- POD-based mixed-integer optimal control of the heat equation
- POINTWISE RESIDUAL METHOD FOR SOLVING PRIMAL AND DUAL ILL-POSED LINEAR PROGRAMMING PROBLEMS WITH APPROXIMATE DATA
- An improved formulation for the inventory routing problem with time-varying demands
- Simplex algorithms for linear programming
- Beyond p-Boxes and Interval-Valued Moments: Natural Next Approximations to General Imprecise Probabilities
- Title not available (Why is that?)
- Tight approximation algorithms for geometric bin packing with skewed items
- The multilinear model in multicriteria decision making: the case of 2-additive capacities and contributions to parameter identification
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- On tail dependence matrices. The realization problem for parametric families
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems
- Linear programming. Foundations and extensions.
- Title not available (Why is that?)
- Optimizing Large-Scale Linear Energy System Problems with Block Diagonal Structure by Using Parallel Interior-Point Methods
- On the existence of a short pivoting sequence for a linear program
- A hybrid simulated annealing/linear programming approach for the cover printing problem
- Injective convex polyhedra
- Title not available (Why is that?)
- Title not available (Why is that?)
- A multilevel bilinear programming algorithm for the vertex separator problem
- Strictly feasible solutions and strict complementarity in multiple objective linear optimization
- Linear programming. Foundations and extensions
- An extension of the fundamental theorem of linear programming
- ON MARINE LIABILITY PORTFOLIO MODELING
- A simplex-type algorithm for continuous linear programs with constant coefficients
- Linear programming: foundations and extensions
- Significance testing in non-sparse high-dimensional linear models
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 Q5891086)
