A computer code for solving medium sized non-linear programming problems by the method of feasible directions.
computercodefors00harr.pdf (2.864Mb)Abstract
A computer code, FEASBL, is developed to maximize a
non-linear objective function over a convex feasible region.
The feasible region is defined by a set of non-linear and
linear constraints on the variables. FEASBL can solve problems
involving up to fifty variables with a feasible region
formed by up to fifty non-linear constraints, and fifty
linear constraints. FEASBL uses a feasible direction method
as its solution algorithm.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.Collections
Related items
Showing items related by title, author, creator and subject.
-
An Iterative Linear Programming Approach to Solving Large Cumulative Search-Evasion Games
(Monterey, California. Naval Postgraduate School, 1990-03);Cumulative search-evasion games (CSEGs) involve two players, a searcher and an evader, who move among some finite set of cells. Neither player is aware of the other player's position during any stage of the game. When the ... -
A linear programming model for use in engineering force requirements planning.
(Monterey, California ; Naval Postgraduate School, 1970-09);Current force planning methodology for determining the proper level, mix, and balance of U.S. Army Engineer Forces required to support theater level military operations is examined and a linear programming model is ... -
Optimizing multi-ship, multi-mission operational planning for the Joint Force Maritime Component Commander
(Monterey, California. Naval Postgraduate School, 2009-03);Operational-level planners in Maritime Operations Centers aim to assign naval forces in support of combatant commanders efficiently and effectively, but they lack a software-based planning tool to develop optimal ship ...
