scientific article
From MaRDI portal
Publication:3039035
zbMath0525.90062MaRDI QIDQ3039035
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parametric programmingdecompositiondualityupper boundingcomputational aspectssparse matrix techniqueselectric power generationlarge scale modelspostoptimalitypartitioned preassigned pivot procedurerevised simplex
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Duality theory (optimization) (49N15)
Related Items
A hybrid algorithm for solving convex separable network flow problems, A note on exploiting structure when using slack variables, Communication protocols for options and results in a distributed optimization environment, A regularized simplex method, Numerical solution of positive control problem via linear programming, Regularizing functions in many-period production optimization models, Exploiting special structure in Karmarkar's linear programming algorithm, Extreme residuals in regression model. Minimax approach, The simplex method is not always well behaved, A multiobjective evolutionary approach for linearly constrained project selection under uncertainty, A continuous linear optimization model for the exact solution of travelling-salesman-problems in connexion with expansion planning of ring networks, Automatic formulation of stochastic programs via an algebraic modeling language, Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account, Solving linear programs with multiple right-hand sides: Pricing and ordering schemes, Piecewise-linear programming: The compact (CPLP) algorithm, Several multi-criteria programming methods for classification, INDUCTIVE COMPOSITION OF NUMBERS WITH MAXIMUM, MINIMUM, AND ADDITION: A New Theory for Program Execution-Time Analysis, HOPDM - a higher order primal-dual method for large scale linear programming, Computer-based algorithms for multiple criteria and multiple constraint level integer linear programming, A structure-conveying modelling language for mathematical and stochastic programming, Unnamed Item, New crash procedures for large systems of linear constraints, A Structure Conveying Parallelizable Modeling Language for Mathematical Programming, Algebraic languages for mathematical programming, Making sparse matrices sparser: Computational results, The more-for-less paradox in linear programming, Constructive methods of control optimization in nonlinear systems, A repository of convex quadratic programming problems, On the efficient use of the architecture of a small computer for LP algorithms, Sensitivity method for basis inverse representation in multistage stochastic linear programming problems, Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
