scientific article; zbMATH DE number 3825556
From MaRDI portal
Publication:3671749
computational complexitycyclingdecompositiondegeneracydualityellipsoid algorithmfractional linear programmingmultiobjective linear programmingpostoptimality analysissimplex methodstabilityvector optimizationzero-sum two-person matrix games
Linear inequalities of matrices (15A39) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01) Duality theory (optimization) (49N15) Iterative numerical methods for linear systems (65F10) Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32) 2-person games (91A05)
Cited in
(79)- A reduction of lattice tiling by translates of a cubical cluster
- A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
- Implementing an affine scaling algorithm for linear programming
- Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers
- A geometric view of parametric linear programming
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- On the interaction between indirect cost allocations and the firm's objectives
- A reverse search algorithm for the neighborhood problem
- Lexicographic bottleneck combinatorial problems
- Bilinear separation of two sets in n-space
- Unrefined minimal \(K\)-types for \(p\)-adic groups
- A finite concave minimization algorithm using branch and bound and neighbor generation
- Descent approaches for quadratic bilevel programming
- On the Nipp polyhedron algorithm for solving singular perturbation problems
- Maximal descriptor set characterizations of efficient faces in multiple objective linear programming.
- A polytopic game
- Viability of infeasible portfolio selection problems: A fuzzy approach
- Computing pure Nash equilibria in network revenue management games
- Singularly perturbed linear programs and Markov decision processes
- Sliding-MOMP based channel estimation scheme for ISDB-T systems
- A complementarity approach to a quasistatic multi-rigid-body contact problem
- The more-for-less paradox in linear programming
- 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\)
- Flexible quantile contour estimation for multivariate functional data: beyond convexity
- Conditional selective inference for robust regression and outlier detection using piecewise-linear homotopy continuation
- Estimation of cost efficiency with piecewise linear cost function in integer-valued data envelopment analysis
- Computing the sequence of k-cardinality assignments
- Parameterized strategies specification in Maude
- New method for solving fuzzy transportation problems with \textit{LR} flat fuzzy numbers
- Bayesian knowledge base tuning
- Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients
- Improving hit-and-run for global optimization
- Interactive decision support for multiobjective transportation problems
- Massive data classification via unconstrained support vector machines
- Inverse optimization for multi-objective linear programming
- Multiparametric linear programming with applications to control
- A linear risk-return model for enhanced indexation in portfolio optimization
- Exact statistical inference for the Wasserstein distance by selective inference. Selective inference for the Wasserstein distance
- All-integer column generation for set partitioning: basic principles and extensions
- Circumventing the Slater conundrum in countably infinite linear programs
- Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs
- A Variable-Complexity Norm Maximization Problem
- Affirmative action algorithms
- The Null Space Problem II. Algorithms
- Substitutes and Complements in Constrained Linear Models
- On the complexity of quantified linear systems
- Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints
- scientific article; zbMATH DE number 1759762 (Why is no real title available?)
- A complexity perspective on entailment of parameterized linear constraints
- Maximum difference extreme difference method for finding the initial basic feasible solution of transportation problems
- The bipartite QUBO
- Projection under pairwise distance control
- An algorithm for piece-wise indefinite quadratic programming problem
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
- Minimum norm interpolation in the \(\ell_1(\mathbb{N})\) space
- On the topological Picard's fixed point iterative algorithm for the simplex method of optimization
- scientific article; zbMATH DE number 7487924 (Why is no real title available?)
- Approximating the Pareto frontier for a challenging real-world bi-objective covering problem
- A fuzzy method to repair infeasibility in linearly constrained problems
- Optimization of sparsity-constrained neural networks as a mixed integer linear program
- Information-theoretic interpretation of quantum formalism
- 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
- The cost transportation game for collaboration among transportation companies
- Learning sets of probabilities through ensemble methods
- Global pricing and feasible directions in linear programming
- A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
- A global pricing extension of the simplex method
- Credal ensembling in multi-class classification
- On the solution of NP-hard linear complementarity problems
- A solution approach to the multi-level linear fractional programming problems
- Another look at linear programming for feature selection via methods of regularization
- A combinatorial optimization approach to the selection of statistical units
- Bounded isotonic median regression
- Searching for multiobjective preventive maintenance schedules: combining preferences with evolutionary algorithms
- Graph decompositions for demographic loop analysis
- Active constraint set invariancy sensitivity analysis in linear optimization
- Risk management strategies via minimax portfolio optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671749)
