scientific article; zbMATH DE number 3637614

zbMath0409.90079MaRDI QIDQ4197641

Publication date: 1979

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

Computational Complexity Vector Optimization Simplex Method Complex Linear Programming Problem Consistency of Systems of Linear Inequalities Polynomial Solvability Set Solutions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items

Tensors in computations, Exact computation of an error bound for the balanced linear complementarity problem with unique solution, A gradient sampling algorithm for stratified maps with applications to topological data analysis, Explainability of probabilistic bisimilarity distances for labelled Markov chains, A geometric approach to betweenness, The possible winner with uncertain weights problem, A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation, An ellipsoid algorithm for equality-constrained nonlinear programs, On the parallel approximability of a subclass of quadratic programming., Convexity and global optimization: A theoretical link, Simple Stochastic Games with Few Random Vertices Are Easy to Solve, Unnamed Item, Unnamed Item, On solving the densestk-subgraph problem on large graphs, An introduction to parallelism in combinatorial optimization, Deciding probabilistic automata weak bisimulation: theory and practice, Introduction: New approaches to linear programming, Ranking games, A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs, On the complexity of minmax regret linear programming, Karmarkar's algorithm and its place in applied mathematics, Objective functions and the complexity of policy design, Geometric sets of low information content, On the complexity of some geometric problems in unbounded dimension, The stable fixtures problem with payments, On linear programming and matrix scaling over the algebraic numbers, The fractional multidimensional knapsack problem: solution and uniqueness, Bounds on the complexity of halfspace intersections when the bounded faces have small dimension, Solving systems of polynomial inequalities in subexponential time, A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices, A simple method for convex optimization in the oracle model, A hybrid approach of bundle and Benders applied large mixed linear integer problem, A polynomial projection-type algorithm for linear programming, An Analogue of the Shannon Capacity of a Graph, A new integer programming formulation for the permutation flowshop problem, Regularizing conjunctive features for classification, The differential of probabilistic entailment, A linear programming primer: from Fourier to Karmarkar, Reformulation of the linear program for completely ergodic MDPs with average cost criteria, Reasoning in fuzzy description logics using automata, Finding and Recognizing Popular Coalition Structures, On genuinely time bounded computations, Solving Simple Stochastic Games, An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness, A branch and bound algorithm for the acyclic subgraph problem, Experiments with external pivoting, The ellipsoid method in linear programming, On relaxation methods for systems of linear inequalities, Expressive markets for donating to charities, Complexity of linear programming, Recent development in computational complexity characterization of Nash equilibrium, Nash equilibria: complexity, symmetries, and approximation, Linear time algorithms for linear programming, Cost-effective allocations of bounded and binary resources in polynomial time, Selfish splittable flows and NP-completeness, On search over rationals, The complexity of controlled selection, Prune-and-search with limited workspace, Solutions for the stable roommates problem with payments, New complexity results about Nash equilibria, On stable least squares solution to the system of linear inequalities, A guide to conic optimisation and its applications, A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem, The diagonalizability of quadratic functions and the arbitrariness of shadow prices, Efficient edge-skeleton computation for polytopes defined by oracles, Exterior point simplex-type algorithms for linear and network optimization problems, A distributed computation algorithm for solving portfolio problems with integer variables, Expressing combinatorial optimization problems by linear programs, Ragnar Frisch and interior-point methods, Computing the minimal covering set, Semidefinite programming and arithmetic circuit evaluation, Scientific contributions of Leo Khachiyan (a short overview), A note on two fixed point problems, A geometric view of parametric linear programming, On Stackelberg mixed strategies, Matching theory -- a sampler: From Dénes König to the present, Projection algorithms for linear programming, On the hardness of computing intersection, union and Minkowski sum of polytopes, Minimum perfect bipartite matchings and spanning trees under categorization, Pricing lotteries, New results on the average behavior of simplex algorithms, A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery, A constraint generation algorithm for large scale linear programs using multiple-points separation, Heuristics for scheduling unrelated parallel machines, On the finding of final polynomials, A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems, Properties of MPC for max-plus-linear systems, The trouble with the second quantifier, A polynomial algorithm for convex quadratic optimization subject to linear inequalities, Method of centers for minimizing generalized eigenvalues, A note on approximate Nash equilibria, Fractional Dominating Parameters, Approximating linear programming is log-space complete for P, A space decomposition-based deterministic algorithm for solving linear optimization problems, On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming, A polynomial algorithm for minimum quadratic cost flow problems, Values for level structures with polynomial-time algorithms, relevant coalition functions, and general considerations, On the Chvátal rank of the pigeonhole principle, Condition measures and properties of the central trajectory of a linear program, A survey on the complexity of tournament solutions, Exploiting special structure in semidefinite programming: a survey of theory and applications, Domination, independent domination, and duality in strongly chordal graphs, On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties, Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses, Performance evaluation of concurrent systems using Petri nets, Scheduling subject to resource constraints: Classification and complexity, Querying temporal and spatial constraint networks in PTIME, Method of Alternating Contractions and Its Applications to Some Convex Optimization Problems, Total weak unimodularity: Testing and applications, Analysis of a linear programming heuristic for scheduling unrelated parallel machines, Pivot versus interior point methods: Pros and cons, Updating beliefs with incomplete observations, The naive credal classifier, Exact credal treatment of missing data