Shadow method for convex programming with application for Navy credit sea/shore rotation problem (Q2640442)

The author developes a special method, called the shadow method, for approximating the solution to a convex programming problem based on the ``interval approach'' proposed by \textit{A. Charnes} and \textit{W. W. Cooper} [see ``The GPSSR system to support management of policy and execution of the U.S. Navy's sea/shore rotation program'', Res. Rep. CCS 495, Cent. Cybern. Stud., Univ. Texas (Austin 1984)]. The method incorporates upper and lower bound constraints in the main body of the algorithm. The result of this type of approximation is a ``network problem with side constraints''; thus, to find a good heuristic solution of the problem NETSID can be used. This method is applied to solve a Navy credit sea/shore rotation problem.