scientific article

Publication date: 1979

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

computational complexity vector optimization polynomial algorithm simplex method polynomial solvability complex linear programming

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 (only showing first 100 items - show all)

MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations ⋮ Solving Linear Programming with Constraints Unknown ⋮ Exact Incremental Analysis of Timed Automata with an SMT-Solver ⋮ Even circuits in oriented matroids ⋮ The polynomial hierarchy and a simple model for competitive analysis ⋮ On box totally dual integral polyhedra ⋮ A Variable-Complexity Norm Maximization Problem ⋮ Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems ⋮ Linear equations for unordered data vectors in $[D^k\to{}Z^d$] ⋮ From Parity and Payoff Games to Linear Programming ⋮ A class of convergent primal-dual subgradient algorithms for decomposable convex programs ⋮ On computational complexity of construction of c -optimal linear regression models over finite experimental domains ⋮ On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming ⋮ Regular triangulations and Steiner points ⋮ Some recognition problems related to graph isomorphism ⋮ Approximating Scheduling Machines with Capacity Constraints ⋮ Incentive Stackelberg Mean-Payoff Games ⋮ The price of defense ⋮ On the complexity of nucleolus computation for bipartite $b$-matching games ⋮ Parameterized Weighted Containment ⋮ A Class of Balanced Matrices Arising from Location Problems ⋮ An application of Farkas' lemma to finite-valued constraint satisfaction problems over infinite domains ⋮ Subgradient ellipsoid method for nonsmooth convex problems ⋮ Approximability results for the $p$-centdian and the converse centdian problems ⋮ Explicit explore, exploit, or escape $(E^4)$: near-optimal safety-constrained reinforcement learning in polynomial time ⋮ Polynomial-time data reduction for weighted problems beyond additive goal functions ⋮ Complexity of optimizing over the integers ⋮ Synthesis of parametric hybrid automata from time series ⋮ An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems ⋮ Restricted Gröbner fans and re-embeddings of affine algebras ⋮ The octatope abstract domain for verification of neural networks ⋮ Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty ⋮ Revisiting security estimation for LWE with hints from a geometric perspective ⋮ How Do Exponential Size Solutions Arise in Semidefinite Programming? ⋮ Eigenpolytope Universality and Graphical Designs ⋮ The computability of LQR and LQG control ⋮ The maximin support method: an extension of the d'Hondt method to approval-based multiwinner elections ⋮ Hardness Results for Structured Linear Systems ⋮ A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility ⋮ On connectionist models ⋮ Resolvability of Hamming Graphs ⋮ A Friendly Smoothed Analysis of the Simplex Method ⋮ McCulloch-Pitts Brains and Pseudorandom Functions ⋮ Constraint Satisfaction Problems over Numeric Domains ⋮ On the complexity of problems on simple games ⋮ SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework ⋮ An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming ⋮ An improved version of Chubanov's method for solving a homogeneous feasibility problem ⋮ Voting Procedures, Complexity of ⋮ METHOD FOR SEQUENTIAL ACTIVATION OF LIMITATIONS IN LINEAR PROGRAMMING ⋮ An approach to the construction of approximate solutions of Boolean linear programming problems ⋮ A simple polynomial-time rescaling algorithm for solving linear programs ⋮ A class of rank-two ellipsoid algorithms for convex programming ⋮ On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method ⋮ Application of the ellipsoid method in an interactive procedure for multicriteria linear programming ⋮ Max-Closed Semilinear Constraint Satisfaction ⋮ The History of the LLL-Algorithm ⋮ Resolution Width and Cutting Plane Rank Are Incomparable ⋮ Unnamed Item ⋮ Graph transformations preserving the stability number ⋮ Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning ⋮ Complexity aspects of a semi-infinite optimization problem† ⋮ Exponential Lower Bounds for Polytopes in Combinatorial Optimization ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts ⋮ Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals ⋮ Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals ⋮ Newton–Ellipsoid polynomiography ⋮ Trace Refinement in Labelled Markov Decision Processes ⋮ Generating all vertices of a polyhedron is hard ⋮ The Stable Fixtures Problem with Payments ⋮ Unnamed Item ⋮ POINTWISE RESIDUAL METHOD FOR SOLVING PRIMAL AND DUAL ILL-POSED LINEAR PROGRAMMING PROBLEMS WITH APPROXIMATE DATA ⋮ Book Review: The basic George B. Dantzig ⋮ Conflict Analysis for MINLP ⋮ Khachiyan's Algorithmus ⋮ Unnamed Item ⋮ Convergence of a cyclic ellipsoid algorithm for systems of linear equalities ⋮ Modifications and implementation of the ellipsoid algorithm for linear programming ⋮ Optimal scaling of balls and polyhedra ⋮ On transformation of conditional, conformant and parallel planning to linear programming ⋮ Linear Programming with Inexact Data is NP‐Hard ⋮ Method of ellipsoids, its generalizations and applications ⋮ Investigation of optimization methods and their applications ⋮ The Average number of pivot steps required by the Simplex-Method is polynomial ⋮ Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games ⋮ A quantum interior-point predictor–corrector algorithm for linear programming ⋮ A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix ⋮ Computational complexity of optimization and crude range testing: A new approach motivated by fuzzy optimization ⋮ Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic ⋮ Geometric random edge ⋮ A practical implementation of stochastic programming: an application to the evaluation of option contracts in supply chains ⋮ Buying optimal payoffs in bi-matrix games ⋮ Asymptotic analysis of the exponential penalty trajectory in linear programming ⋮ A theory for memory-based learning ⋮ Polynomial algorithms for linear programming over the algebraic numbers ⋮ A branch bound method for subset sum problem ⋮ On the complexity of some basic problems in computational convexity. I. Containment problems ⋮ Tropically convex constraint satisfaction ⋮ Bounded self-stabilizing Petri nets ⋮ A primal-dual interior point method whose running time depends only on the constraint matrix

This page was built for publication: