2020
DOI: 10.1007/s11590-020-01644-6
|View full text |Cite
|
Sign up to set email alerts
|

The Big-M method with the numerical infinite M

Abstract: Linear programming is a very well known and deeply applied field of optimization theory. One of its most famous and used algorithms is the so called Simplex algorithm, independently proposed by Kantorovič and Dantzig, between the end of the 30s and the end of the 40s. Even if extremely powerful, the Simplex algorithm suffers of one initialization issue: its starting point must be a feasible basic solution of the problem to solve. To overcome it, two approaches may be used: the two-phases method and the Big-M m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
29
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
4
2

Relationship

3
7

Authors

Journals

citations
Cited by 61 publications
(29 citation statements)
references
References 19 publications
0
29
0
Order By: Relevance
“…Since P 0,agg,k is unknown, the big-M is used to limit the value of Ξ i,k i ∈ r j . It is worth mentioning that the big-M must be selected, large enough, but not too high to prevent the M value influencing the results of the optimization problem [37]. For instance, in this case, the values of all variables are in p.u., thus, an M value of 10 is adequate.…”
Section: Estimation Of Parameters Of the Emz-zip Load Modelmentioning
confidence: 99%
“…Since P 0,agg,k is unknown, the big-M is used to limit the value of Ξ i,k i ∈ r j . It is worth mentioning that the big-M must be selected, large enough, but not too high to prevent the M value influencing the results of the optimization problem [37]. For instance, in this case, the values of all variables are in p.u., thus, an M value of 10 is adequate.…”
Section: Estimation Of Parameters Of the Emz-zip Load Modelmentioning
confidence: 99%
“…Recent advances for multi-objective prioritized optimization, whether lexicographic [110][111][112] or Pareto-lexicographic [113][114][115], have developed programming tools and algorithms that have given new life to the study of lexicographic game theory [116,117]. As a consequence, the numerical study and solution of the practical problems mentioned above seem possible, possibly paving the way for a new approach to autonomous marine path planning.…”
Section: Opportunities and Way Aheadmentioning
confidence: 99%
“…Recent literature has started to reconsider lexicographic problems, trying to solve the issues coming from both scalarization and preemptive approaches leveraging recent developments in numerical non-Archimedean computations [11,12,13]. Some results involve game theory [14,15,16], evolutionary optimization [17,18,19], linear programming tackled by Simplex-like methods [20,4,21,22]. Actually, the key idea is to scalarize the problem adopting infinite and infinitesimal weights.…”
Section: Introductionmentioning
confidence: 99%