Video Experimental Relacionado
Updated: Sep 9, 2025
06:52
Using Cholesky Decomposition to Explore Individual Differences in Longitudinal Relations between Reading Skills
Published on: September 17, 2019
6.4K
Programación diádica lineal y extensiones
Ahmad Abdi1, Gérard Cornuéjols2, Bertrand Guenin3
1Department of Mathematics, London School of Economics, London, England, UK.
Mathematical programming
|September 4, 2025
Resumen
Este estudio introduce un método para resolver de manera eficiente los programas lineales diádicos, que son cruciales para los cálculos precisos de la computadora. La investigación proporciona algoritmos de tiempo polinómico y límites para soluciones racionales diádicas en programación lineal.
Área de la Ciencia:
- Análisis numérico
- Matemáticas computacionales
- Teoría de la optimización
Sus antecedentes:
- Los números racionales diádicos, definidos como p / 2 ^ k, ofrecen representaciones binarias finitas exactas.
- Estos números son vitales para la aritmética precisa de punto flotante en las tareas computacionales.
- Un vector diádico comprende elementos que son todos racionales diádicos.
Objetivo del estudio:
- Investigar la existencia y el cálculo de soluciones óptimas diádicas para programas lineales.
- Desarrollar algoritmos eficientes para resolver programas lineales diádicos.
Principales métodos:
- Formulación y análisis de programas lineales con restricciones y soluciones diádicas.
- Desarrollo de algoritmos de tiempo polinómico adaptados a la aritmética racional diádica.
- Establecimiento de límites en el tamaño del soporte de la solución y la magnitud del denominador.
Principales resultados:
- Demostración de que los programas lineales diádicos se pueden resolver en tiempo polinómico.
- Derivación de los límites para el tamaño del soporte y denominadores de las soluciones diádicas.
- Identificación de las propiedades clave (cierre bajo adición/negación, densidad) que permiten soluciones diádicas de LP.
Conclusiones:
- Los programas lineales diádicos se pueden resolver de manera eficiente, con límites garantizados en las características de la solución.
- El marco algorítmico puede extenderse a clases más amplias de problemas más allá de los racionales estrictamente diádicos.
Videos de Conceptos Relacionados
01:16Statically Indeterminate Problem Solving
490
Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...
490
01:26Constraints and Statical Determinacy
682
In structural engineering, the equilibrium of a system is not only determined by its equations of equilibrium but also with the help of constraints. Constraints refer to restrictions on the motion of a system. The proper combinations of constraints can minimize the total number of constraints needed to maintain a system in mechanical equilibrium. When this happens, the system is said to be statically determinate. For such systems, the unknown reaction supports can be estimated using equilibrium...
682
01:23Linear time-invariant Systems
398
A system is linear if it displays the characteristics of homogeneity and additivity, together termed the superposition property. This principle is fundamental in all linear systems. Linear time-invariant (LTI) systems include systems with linear elements and constant parameters.
The input-output behavior of an LTI system can be fully defined by its response to an impulsive excitation at its input. Once this impulse response is known, the system's reaction to any other input can be...
The input-output behavior of an LTI system can be fully defined by its response to an impulsive excitation at its input. Once this impulse response is known, the system's reaction to any other input can be...
398
01:29Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
100
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
100
01:21Linear Approximation in Time Domain
124
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
124
01:06Parallel-axis Theorem
7.2K
The parallel-axis theorem provides a convenient and quick method of finding the moment of inertia of an object about an axis parallel to the axis passing through its center of mass. Consider a thin rod as an example. There is a striking similarity between the process of finding the moment of inertia of a thin rod about an axis through its middle, where the center of mass lies, and about an axis through its end using the conventional method. In the conventional method, the concept of linear mass...
7.2K