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

DOI10.1016/0898-1221(90)90242-CzbMath0719.90053OpenAlexW2073265454MaRDI QIDQ2640442

I. A. Krass

Publication date: 1990

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(90)90242-c

zbMATH Keywords

heuristicshadow methodupper and lower bound constraints

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Theory of organizations, manpower planning in operations research (90B70)

Cites Work

• Unnamed Item
• An application of dynamic modeling to the sea shore rotation planning problem in the Navy
• An assessment of some criticisms of goal programming
• Properties of von Neumann-Gale cooperation models
• Goal programming and multiple objective optimizations. Part I
• Model Building Techniques for the Correction of End Effects in Multistage Convex Programs
• A polynomially bounded algorithm for a singly constrained quadratic program

This page was built for publication: Shadow method for convex programming with application for Navy credit sea/shore rotation problem