Abstract
The article generalizes Germeier’s attack-defense model to allow for integer-valued and nonhomogeneous opponent resources and echeloned defense. It performs target allocation by solving the classical transportation problem on each level, which leads to discrete minimax problems for the best guaranteed defense outcome. These minimax problems can be solved by a coordinatewise-descent method based on a discrete analogue of Germeier’s equalization principle.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
