Abstract
In this paper, a cubic objective programming problem (COPP) is defined. Introduced a new modification to solve a cubic objective programming problem. Suggested an algorithm for its solution. Also reported the algorithm of the usual simplex method. Application talks about how the developed algorithm can be used to unravel non-linear. The proposed technique, modification simplex technique, can be used with the constructed numerical examples an illustrative numerical problems are given to demonstrate the algorithms.
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.
