Abstract

A first order predicate calculus for the representation of mathematical optimization models is developed. It is shown that the relational scheme of a database can be inferred from the algebraic representation of the optimization models. More importantly, it is shown that the indices for an iterated operator can be inferred. This inference results in the reduction of syntactical burden on users of systems which will be based on this model. Assuming a relational representation of data, a relational model for the expression of constraints and objective functions of the optimization models is introduced.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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

Disclaimer: 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.