I have a LP design for my problem(not relevant) where most of the variables gets assigned the value of 0. I want to scale the LP to more variables and equations, and thus want to know the contribution of basic and non basic variables in terms of time for solving the LP. Alternately, if I add variables to an existing LP(expecting the new variables get assigned the value of 0), how much is the time compared to adding a variable which is guaranteed to be basic.
2026-03-27 21:44:00.1774647840
Efficiency in terms of basic and non basic variables of a LP
31 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in LINEAR-ALGEBRA
- An underdetermined system derived for rotated coordinate system
- How to prove the following equality with matrix norm?
- Alternate basis for a subspace of $\mathcal P_3(\mathbb R)$?
- Why the derivative of $T(\gamma(s))$ is $T$ if this composition is not a linear transformation?
- Why is necessary ask $F$ to be infinite in order to obtain: $ f(v)=0$ for all $ f\in V^* \implies v=0 $
- I don't understand this $\left(\left[T\right]^B_C\right)^{-1}=\left[T^{-1}\right]^C_B$
- Summation in subsets
- $C=AB-BA$. If $CA=AC$, then $C$ is not invertible.
- Basis of span in $R^4$
- Prove if A is regular skew symmetric, I+A is regular (with obstacles)
Related Questions in LINEAR-PROGRAMMING
- Proving dual convex cone property
- Linear algebra: what is the purpose of passive transformation matrix?
- Building the model for a Linear Programming Problem
- Show that $ \ x_ 0 \ $ cannot be an optimal solution
- Is there any way to model this situation in integer programming?
- How to Solve a Linear Programming Problem in $n$ Dimension Space?
- How to solve a linear program without any given data?
- Constraints for continuous path within graph with at least one obligatory node in path
- Select the smallest strict positive value from a list of variables in a linear program.
- How to add nonnegative constraint to an LP problem
Related Questions in INTEGER-PROGRAMMING
- Dynamic programming for Knapsack problem
- Find minimum $x+y+z$ given $3x=4y=7z$ and $x, y, z \in \mathbb N^+$
- conditional constraints -Integer programming
- Integer programming proof: If an LP is unbounded then the IP is unbounded
- Integrality gap of maximum weighted clique
- "No two values are the same" constraint in linear programming
- Looking for some information on applications of integer linear programming
- How to find the number of possible ways to climb the staircase
- Consecutive binary variables, without using auxiliary variables
- Job Shop Optimization -- Minimize Total Completion Time
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
With an integer program, it is very difficult to predict the effect of adding integer variables that are highly like to take value zero in the optimal solution. Depending on both the specific model and the software used, it is possible that the presolver will fix some or all of the extra variables to zero before the root LP is solved. If the variables not removed by presolving are "unattractive", they may wind up with zero values in the node LP solutions. Carrying the extra variables will create some drag (since the solver is dealing with a larger LP relaxation), but possibly not a great deal of drag. Note that I'm saying "possible" a lot: there are no guarantees, and the only way to know is to try.
One possible approach to consider would be to solve the model without the extra variables, then add them and solve the expanded model, using the final solution from the first run as a starting solution to the expanded model. This might allow the solver to fix new variables at zero sooner. Personally, I would try solving the expanded model in one shot first, and only try this if solving the full model was taking too long.