The sign of the slope of the objective function on identifying binding constraints in LP Problems
| Autor: | Christina D. Nikolakakou, Dimitris G. Tsarmpopoulos, G. S. Androulakis |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Set (abstract data type)
Mathematical optimization 021103 operations research Linear programming Computer science 0211 other engineering and technologies 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Point (geometry) 02 engineering and technology Focus (optics) Sign (mathematics) |
| Zdroj: | PCI |
| DOI: | 10.1145/3437120.3437320 |
| Popis: | Linear programming (LP) is an important technique for solving linear optimization problems. Such problems arise in many applications and are described by a linear objective function and a set of linear constraints. In real world applications usually the number of constraints is significantly larger than the number of variables making the problem more complex. Thus, since only the binding constraints participate in the determination of the optimal point, in order to make an LP method more attractive in practice, it is important the research interest to focus on eliminating redundant constraints. In this paper, the proposed technique focuses on identifying binding constraints and the numerical results, in 20000 random LP test problems are effective and promising. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|