EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

DISCRETE MINIMAX AND MINIMIN REFORMULATION

Songkomkrit Chaiyakan, Preecha Vichitthamaros

Far East Journal of Mathematical Sciences (FJMS) · 22.05.2026 · 143 (6) · 1795-1799

DOI: 10.17654/0972087126104 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Far East Journal of Mathematical Sciences (FJMS), online erschienen am 22.05.2026. Verfasst von Songkomkrit Chaiyakan und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This work rigorously transforms discrete minimax and minimin problems into usual optimization problems. In case of a minimin problem, binary decision variables are introduced to enumerate all possibilities. Fast computation time and flexibility are expected due to a branch-and-cut method usually implemented in most optimizers.

Zitieren

APA

Chaiyakan, S., & Vichitthamaros, P. (2026). DISCRETE MINIMAX AND MINIMIN REFORMULATION. Far East Journal of Mathematical Sciences (FJMS), 143(6), 1795-1799. https://doi.org/10.17654/0972087126104

Vancouver

Chaiyakan S, Vichitthamaros P. DISCRETE MINIMAX AND MINIMIN REFORMULATION. Far East Journal of Mathematical Sciences (FJMS). 2026;143(6):1795-1799. doi:10.17654/0972087126104

BibTeX
@article{Chaiyakan2026,
  author = {Chaiyakan, Songkomkrit and Vichitthamaros, Preecha},
  title = {DISCRETE MINIMAX AND MINIMIN REFORMULATION},
  journal = {Far East Journal of Mathematical Sciences (FJMS)},
  year = {2026},
  volume = {143},
  number = {6},
  pages = {1795--1799},
  doi = {10.17654/0972087126104}
}
Kostenlos starten →