Abstract
Applications of discrete mathematical programming may be subdivided into those involving economies of scale, those involving mutually exclusive variables and those involving nonconvexity in the constraint set. Exxon’s earliest successful applications involved investment planning under economies of scale. Operations scheduling applications are characterized by mutually exclusive variables: these have been solved satisfactorily by heuristic methods and by branch-and-bound methods running under stream-lined computational procedures. Nonconvex constraints are found in engineering design problems: these require artful formulation and specialized computational search procedures. Research is still needed to endow discrete mathematical programming with interactive computation capabilities, with enhanced analytical and interpretive options and with extensions into the domain of mathematical programming under uncertainty.
Published Version
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
