Abstract
This article studies a cost project problem identified here as the Moon project with mathematical laws. The Moon project is a program cost project regulated by certain constraints with principal variable N∈Z that survives on project h∈H only if it survives the lowest level (level 1). For this particular problem, we model the total cost T for mounting a Moon project under project coordinates involving the inward payables (w), the outward payables (x), consumables (y), cross subsidisation (z) as independent coordinates and sufficient for describing the configuration of complicated production systems. Additionally, optimal path analysis to completeness in form of examples and remarks on Moon projects survival chances is provided.
Sign-in/Register to access full text options 
Free) 
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 call
