CONSTRAINED OPTIMIZATION MODEL FOR OPTIMIZING MULTI-YEAR SPACE PROGRAMS

摘要

The January 14, 2004 Space Exploration and Utilization Initiative announced by the USA contains a broad invitation to all Space-faring nations and all User Groups in Science, Industry, robotic and human Space Exploration, tourism, colonization, etc., to join together in a Multi-Year, International sustainable Space Venture. How can such a Venture be affordable? Planners have suggested building a Reusable, Sustainable Space Transportation Infrastructure (RSSTI), supported by International Venture Partners and Users, to increase mission synergism, reduce costs and increase scientific and pragmatic returns from this Space Initiative. New reusable vehicles, use of the L_1 Earth/Moon and L_2 Sun/Earth Lagrange Points, "planetary" bases, other "Gateways" and new applications are yielding many new mission architectures and operations. How can we select the "best", most efficient Multi-Year Space Program Plan? In this paper we construct a Constrained Optimization Binary Linear Programming Model to optimize a "Pay-Off Function", subject to realistic Space Mission constraints. An input table for making model runs is presented and solution algorithms are identified. Use of the model will enable the International Space Venture Partners to attain an affordable and sustainable Multi-Year Space Program Plan that will equitably satisfy the desires of these diverse International Partners and Scientific and Commercial User Groups.