The mixed-integer linear programming problem allows this behavior to be modeled by adding the constraint that these variables should take on only integers, or whole numbers, in the optimal solution.
El problema de programación lineal entera-mixta permite modelar este comportamiento mediante la adición de la restricción de que las variables solo deben tener valores enteros en la solución óptima.
Using a mixed-integer linear programming problem to determine the best way to supply sales locations from warehouses and factories.
This nonconvex NLP is decomposed into two hierarchical levels: a master mixed-integer linear programming problem (MILP) that provides a rigorous lower bound on the optimal solution, and a reduced-space slave NLP that yields an upper bound.
Este problema no convexo NLP se descompone en dos niveles jerárquicos: un problema master de programación entera mixta (MILP) que proporciona una cota inferior rigurosa al solución global, y una NLP esclavo de espacio reducido que da un límite superior.
For a video showing this example, see Solve a Mixed-Integer Linear Programming Problem using Optimization Modeling.
For a basic example, see Mixed-Integer Linear Programming Basics: Problem-Based or the video version Solve a Mixed-Integer Linear Programming Problem using Optimization Modeling.
Para un ejemplo básico, consulte Fundamentos de programación lineal de enteros mixtos: basado en problemas o la versión de vídeo Resolver un problema de programación lineal de enteros mixtos mediante el modelado de optimización.
Potentially sensitive or inappropriate content
Examples are used only to help you translate the word or expression searched in various contexts. They are not selected or validated by us and can contain inappropriate terms or ideas. Please report examples to be edited or not to be displayed. Potentially sensitive, inappropriate or colloquial translations are usually marked in red or in orange.