scientific article

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

stability computational complexity vector optimization decomposition ellipsoid algorithm duality degeneracy simplex method multiobjective linear programming cycling postoptimality analysis fractional linear programming zero-sum two-person matrix games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32) Linear programming (90C05) 2-person games (91A05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Linear inequalities of matrices (15A39) Iterative numerical methods for linear systems (65F10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Duality theory (optimization) (49N15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01)

Related Items (71)

Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients ⋮ Approximating the Pareto frontier for a challenging real-world bi-objective covering problem ⋮ A finite concave minimization algorithm using branch and bound and neighbor generation ⋮ Descent approaches for quadratic bilevel programming ⋮ A reduction of lattice tiling by translates of a cubical cluster ⋮ Improving hit-and-run for global optimization ⋮ Interactive decision support for multiobjective transportation problems ⋮ Massive data classification via unconstrained support vector machines ⋮ All-integer column generation for set partitioning: basic principles and extensions ⋮ The Bipartite QUBO ⋮ Estimation of cost efficiency with piecewise linear cost function in integer-valued data envelopment analysis ⋮ A Variable-Complexity Norm Maximization Problem ⋮ A note on the Edmonds-Fukuda pivoting rule for simplex algorithms ⋮ Implementing an affine scaling algorithm for linear programming ⋮ On the Nipp polyhedron algorithm for solving singular perturbation problems ⋮ Circumventing the Slater conundrum in countably infinite linear programs ⋮ Affirmative action algorithms ⋮ Searching for multiobjective preventive maintenance schedules: combining preferences with evolutionary algorithms ⋮ Computing pure Nash equilibria in network revenue management games ⋮ Computing the sequence of $k$-cardinality assignments ⋮ Projection under pairwise distance control ⋮ A general parametric analysis approach and its implication to sensitivity analysis in interior point methods ⋮ Tessellation and $g$-tessellation of circulants, $Q_ 6$, and $Q_ 6^ t$ ⋮ Inverse optimization for multi-objective linear programming ⋮ On the complexity of quantified linear systems ⋮ Unnamed Item ⋮ Parameterized strategies specification in Maude ⋮ Unnamed Item ⋮ Exact statistical inference for the Wasserstein distance by selective inference. Selective inference for the Wasserstein distance ⋮ Optimization of sparsity-constrained neural networks as a mixed integer linear program ⋮ Information-theoretic interpretation of quantum formalism ⋮ Unnamed Item ⋮ The Null Space Problem II. Algorithms ⋮ Maximal descriptor set characterizations of efficient faces in multiple objective linear programming. ⋮ Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs ⋮ Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints ⋮ Substitutes and Complements in Constrained Linear Models ⋮ Some new results in linear programs with trapezoidal fuzzy numbers: finite convergence of the Ganesan and Veeramani's method and a fuzzy revised simplex method ⋮ A complexity perspective on entailment of parameterized linear constraints ⋮ Graph decompositions for demographic loop analysis ⋮ An algorithm for piece-wise indefinite quadratic programming problem ⋮ Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers ⋮ Active constraint set invariancy sensitivity analysis in linear optimization ⋮ A geometric view of parametric linear programming ⋮ Unnamed Item ⋮ A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case ⋮ On the solution of NP-hard linear complementarity problems ⋮ A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem ⋮ A fuzzy method to repair infeasibility in linearly constrained problems ⋮ New method for solving fuzzy transportation problems with \textit{LR} flat fuzzy numbers ⋮ Risk management strategies via minimax portfolio optimization ⋮ Singularly perturbed linear programs and Markov decision processes ⋮ Sliding-MOMP based channel estimation scheme for ISDB-T systems ⋮ Multiparametric linear programming with applications to control ⋮ A linear risk-return model for enhanced indexation in portfolio optimization ⋮ Another look at linear programming for feature selection via methods of regularization ⋮ A combinatorial optimization approach to the selection of statistical units ⋮ A complementarity approach to a quasistatic multi-rigid-body contact problem ⋮ The more-for-less paradox in linear programming ⋮ A polytopic game ⋮ Flexible quantile contour estimation for multivariate functional data: beyond convexity ⋮ On the interaction between indirect cost allocations and the firm's objectives ⋮ Conditional selective inference for robust regression and outlier detection using piecewise-linear homotopy continuation ⋮ Minimum norm interpolation in the ℓ1(ℕ) space ⋮ A reverse search algorithm for the neighborhood problem ⋮ Lexicographic bottleneck combinatorial problems ⋮ Bounded isotonic median regression ⋮ Viability of infeasible portfolio selection problems: A fuzzy approach ⋮ Bilinear separation of two sets in $n$-space ⋮ Unrefined minimal $K$-types for $p$-adic groups ⋮ Bayesian knowledge base tuning

This page was built for publication: