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