Linear Programming
From MaRDI portal
Publication:4421881
DOI10.1007/b97283zbMath1029.90037OpenAlexW4232295239MaRDI QIDQ4421881
Mukund N. Thapa, George B. Dantzig
Publication date: 1 September 2003
Published in: Springer Series in Operations Research and Financial Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b97283
Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Interior-point methods (90C51) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items (58)
Bayesian quantile regression for longitudinal count data ⋮ New superbridge index calculations from non-minimal realizations ⋮ Algebraic simplex initialization combined with the nonfeasible basis method ⋮ Minimum \(t\)-spanners on subcubic graphs ⋮ A strongly polynomial contraction-expansion algorithm for network flow problems ⋮ A constructive way to compute the Tarski number of a group ⋮ On Hoffman's celebrated cycling LP example ⋮ New characterizations for largeness of the core ⋮ Evaluating green suppliers: improving supplier performance with DEA in the presence of incomplete data ⋮ Fuzzy best-worst method based on generalized interval-valued trapezoidal fuzzy numbers for multi-criteria decision-making ⋮ Virtual displacement based discontinuity layout optimization ⋮ On solving fully rough multi-objective fractional transportation problem: development and prospects ⋮ Duality of graph invariants ⋮ Anisotropic mesh adaptation for high-order finite elements spaces with the log-simplex method. Application to discontinuous Galerkin methods ⋮ Measurement of returns to scale using a non-radial DEA model ⋮ Discrete Optimal Transport with Independent Marginals is #P-Hard ⋮ Finite convergence into a convex polytope via facet reflections. ⋮ Convergence and Correctness of Max-Product Belief Propagation for Linear Programming ⋮ A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption ⋮ Classical Logic, Classical Probability, and Quantum Mechanics ⋮ Modeling tau transport in the axon initial segment ⋮ The Support Feature Machine: Classification with the Least Number of Features and Application to Neuroimaging Data ⋮ An Embarrassingly Parallel Method for Large-Scale Stochastic Programs ⋮ Fuzzy linear programming approach for solving fuzzy transportation problems with transshipment ⋮ Production Dependent Agricultural 3D Transportation Problem with Maximization of Annual Net Profit in Generalized Intuitionistic Fuzzy Environment ⋮ The big-M method with the numerical infinite \(M\) ⋮ Using dual presolving reductions to reformulate cumulative constraints ⋮ ON CONFIGURATION GRAPH AND PARADOXICAL DECOMPOSITION ⋮ Convergence conditions for the observed mean method in stochastic programming ⋮ Network equilibrium of production, transportation and pricing for multi-product multi-market ⋮ Relational linear programming ⋮ A novel approach for solving rough multi-objective transportation problem: development and prospects ⋮ Measurement of returns to scale using non-radial DEA models ⋮ A BSSS algorithm for the single facility location problem in two regions with different norms ⋮ An application of a Lagrangian-type relaxation for the uncapacitated facility location problem ⋮ Finding complex balanced and detailed balanced realizations of chemical reaction networks ⋮ Greatest remainder bi-proportional rounding and the Greek parliamentary elections of 2007 ⋮ On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes ⋮ Non-Archimedean zero-sum games ⋮ Relationship of two formulations for shortest bibranchings ⋮ A radial boundary intersection aided interior point method for multi-objective optimization ⋮ Sliding-MOMP based channel estimation scheme for ISDB-T systems ⋮ Fuel and energy system control at large-scale damages. II: Optimization problems ⋮ Characterizing the universal rigidity of generic frameworks ⋮ New computations of the superbridge index ⋮ Vector Space Decomposition for Solving Large-Scale Linear Programs ⋮ Fuzzy best-worst method based on triangular fuzzy numbers for multi-criteria decision-making ⋮ The algorithmic numbers in non-Archimedean numerical computing environments ⋮ An overview on the simplex algorithm ⋮ Concave programming for finding sparse solutions to problems with convex constraints ⋮ Risk optimization with \(p\)-order conic constraints: a linear programming approach ⋮ The minimum mean cycle-canceling algorithm for linear programs ⋮ A chance constrained approach to fractional programming with random numerator ⋮ Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow ⋮ George B. Dantzig: a legendary life in mathematical programming ⋮ Polynomial-time computation of exact correlated equilibrium in compact games ⋮ Dispatch planning using newsvendor dual problems and occupation times: application to hydropower ⋮ Measurement of returns to scale in radial DEA models
This page was built for publication: Linear Programming
