25,978 research outputs found
A Bound for the Number of Different Basic Solutions Generated by the Simplex Method
In this short paper, we give an upper bound for the number of different basic
feasible solutions generated by the simplex method for linear programming
problems having optimal solutions. The bound is polynomial of the number of
constraints, the number of variables, and the ratio between the minimum and the
maximum values of all the positive elements of primal basic feasible solutions.
When the primal problem is nondegenerate, it becomes a bound for the number of
iterations. We show some basic results when it is applied to special linear
programming problems. The results include strongly polynomiality of the simplex
method for Markov Decision Problem by Ye and utilize its analysis.Comment: Keywords: Simplex method, Linear programming, Iteration bound, Strong
polynomiality, Basic feasible solution
A Bound for the Number of Different Basic Solutions Generated by the Simplex Method
In this short paper, we give an upper bound for the number of different basic
feasible solutions generated by the simplex method for linear programming
problems having optimal solutions. The bound is polynomial of the number of
constraints, the number of variables, and the ratio between the minimum and the
maximum values of all the positive elements of primal basic feasible solutions.
When the primal problem is nondegenerate, it becomes a bound for the number of
iterations. We show some basic results when it is applied to special linear
programming problems. The results include strongly polynomiality of the simplex
method for Markov Decision Problem by Ye and utilize its analysis.Comment: Keywords: Simplex method, Linear programming, Iteration bound, Strong
polynomiality, Basic feasible solution
A primal-simplex based Tardos' algorithm
In the mid-eighties Tardos proposed a strongly polynomial algorithm for
solving linear programming problems for which the size of the coefficient
matrix is polynomially bounded by the dimension. Combining Orlin's primal-based
modification and Mizuno's use of the simplex method, we introduce a
modification of Tardos' algorithm considering only the primal problem and using
simplex method to solve the auxiliary problems. The proposed algorithm is
strongly polynomial if the coefficient matrix is totally unimodular and the
auxiliary problems are non-degenerate.Comment: 7 page
Recommended from our members
Primal-dual variable neighborhood search for the simple plant-location problem
Copyright @ 2007 INFORMSThe variable neighborhood search metaheuristic is applied to the primal simple plant-location problem and to a reduced dual obtained by exploiting the complementary slackness conditions. This leads to (i) heuristic resolution of (metric) instances with uniform fixed costs, up to n = 15,000 users, and m = n potential locations for facilities with an error not exceeding 0.04%; (ii) exact solution of such instances with up to m = n = 7,000; and (iii) exact solutions of instances with variable fixed costs and up to m = n = 15, 000.This work is supported by NSERC Grant 105574-02; NSERC Grant OGP205041; and partly by the Serbian Ministry of Science, Project 1583
JuliBootS: a hands-on guide to the conformal bootstrap
We introduce {\tt JuliBootS}, a package for numerical conformal bootstrap
computations coded in {\tt Julia}. The centre-piece of {\tt JuliBootS} is an
implementation of Dantzig's simplex method capable of handling arbitrary
precision linear programming problems with continuous search spaces. Current
supported features include conformal dimension bounds, OPE bounds, and
bootstrap with or without global symmetries. The code is trivially
parallelizable on one or multiple machines. We exemplify usage extensively with
several real-world applications. In passing we give a pedagogical introduction
to the numerical bootstrap methods.Comment: 29 page
When Lift-and-Project Cuts are Different
In this paper, we present a method to determine if a lift-and-project cut for
a mixed-integer linear program is irregular, in which case the cut is not
equivalent to any intersection cut from the bases of the linear relaxation.
This is an important question due to the intense research activity for the past
decade on cuts from multiple rows of simplex tableau as well as on
lift-and-project cuts from non-split disjunctions. While it is known since
Balas and Perregaard (2003) that lift-and-project cuts from split disjunctions
are always equivalent to intersection cuts and consequently to such multi-row
cuts, Balas and Kis (2016) have recently shown that there is a necessary and
sufficient condition in the case of arbitrary disjunctions: a lift-and-project
cut is regular if, and only if, it corresponds to a regular basic solution of
the Cut Generating Linear Program (CGLP). This paper has four contributions.
First, we state a result that simplifies the verification of regularity for
basic CGLP solutions from Balas and Kis (2016). Second, we provide a
mixed-integer formulation that checks whether there is a regular CGLP solution
for a given cut that is regular in a broader sense, which also encompasses
irregular cuts that are implied by the regular cut closure. Third, we describe
a numerical procedure based on such formulation that identifies irregular
lift-and-project cuts. Finally, we use this method to evaluate how often
lift-and-project cuts from simple -branch split disjunctions are irregular,
and thus not equivalent to multi-row cuts, on 74 instances of the MIPLIB
benchmarks.Comment: INFORMS Journal on Computing (to appear
- âŠ