Warning: ini_set(): A session is active. You cannot change the session module's ini settings at this time in /home/updatepublishing/public_html/journal/lib/pkp/classes/session/SessionManager.inc.php on line 69

Warning: Cannot modify header information - headers already sent by (output started at /home/updatepublishing/public_html/journal/lib/pkp/classes/session/SessionManager.inc.php:69) in /home/updatepublishing/public_html/journal/plugins/generic/citationStyleLanguage/CitationStyleLanguagePlugin.inc.php on line 478

Warning: Cannot modify header information - headers already sent by (output started at /home/updatepublishing/public_html/journal/lib/pkp/classes/session/SessionManager.inc.php:69) in /home/updatepublishing/public_html/journal/plugins/generic/citationStyleLanguage/CitationStyleLanguagePlugin.inc.php on line 479
TY - JOUR AU - Kishore, Rajeev PY - 2010/09/23 Y2 - 2025/09/23 TI - Mathematical Science Reformulate Convex Relaxation in Logic Based Optimization JF - Journal of Experimental Sciences JA - JES VL - 1 IS - 5 SE - Formal Sciences DO - UR - https://www.updatepublishing.com/journal/index.php/jes/article/view/1729 SP - AB - <div style="border-right: medium none; padding-right: 0in; border-top: medium none; padding-left: 0in; padding-bottom: 1pt; border-left: medium none; padding-top: 0in; border-bottom: windowtext 1pt solid; mso-element: para-border-div; mso-border-bottom-alt: solid windowtext .5pt;"><span style="font-size: 6pt; font-family: ";Tahoma";,";sans-serif";;"><p class="MsoNormal" style="margin: 6pt 0in 0pt; text-align: justify; mso-layout-grid-align: none;"><strong><span style="font-size: 10pt; font-family: ";Tahoma";,";sans-serif";;">Abstract </span></strong></p><p class="MsoNormal" style="margin: 6pt 0in 0pt; text-align: justify; mso-layout-grid-align: none;"><span style="font-size: 8pt; font-family: ";Tahoma";,";sans-serif";;">We present a convex conic Relaxation for a problem of maximizing an indefinite quadratic form over a set of, convex constraints on the squared variables, convex envelopes of non convex functions are widely used to calculate lower bounds of solutions of non linear programming problem (NLP). This paper proposes a non linear continuous convex envelope for (Linear, bilinear, trilinear fractional) monomial terms of odd degree and the range of variables (x, y, z) includes zero. </span></p><p class="MsoNormal" style="margin: 0in 0in 0pt; text-align: justify; mso-layout-grid-align: none;"><span style="font-size: 8pt; font-family: ";Tahoma";,";sans-serif";;">We also drive a linear relaxation from the proposed envelope and computer both the Linear and non linear formulations with relaxations obtained using other approaches.</span></p><p class="MsoNormal" style="margin: 0in 0in 0pt; text-indent: 31.5pt; text-align: justify; mso-layout-grid-align: none;"><span style="font-size: 8pt; font-family: ";Tahoma";,";sans-serif";;"> </span></p><div style="border-right: medium none; padding-right: 0in; border-top: medium none; padding-left: 0in; padding-bottom: 1pt; border-left: medium none; padding-top: 0in; border-bottom: windowtext 1pt solid; mso-element: para-border-div; mso-border-bottom-alt: solid windowtext .5pt;"><p class="MsoNormal" style="margin: 0in 0in 0pt; text-align: justify; mso-layout-grid-align: none; mso-padding-alt: 0in 0in 1.0pt 0in; mso-border-bottom-alt: solid windowtext .5pt; padding: 0in;"><strong><span style="font-size: 8pt; font-family: ";Tahoma";,";sans-serif";;">Keywords</span></strong><span style="font-size: 8pt; font-family: ";Tahoma";,";sans-serif";;">: Odd degree, Monomial, Convex relaxation, Global optimization </span></p></div><p class="MsoNormal" style="margin: 0in 0in 0pt; text-align: justify; mso-layout-grid-align: none; mso-padding-alt: 0in 0in 1.0pt 0in; mso-border-bottom-alt: solid windowtext .5pt; padding: 0in;">Department of Mathematic, Jamuna Prasad Memorial Degree College, Bareilly</p></span></div><p class="MsoNormal" style="margin: 0in 0in 0pt 0.25in; text-indent: -0.25in; text-align: justify;"><span style="font-size: 8pt; font-family: ";Tahoma";,";sans-serif";;">Please Cite This Article As:</span></p><p class="MsoNormal" style="margin: 0in 0in 0pt 0.25in; text-indent: -0.25in; text-align: justify;"><span style="font-size: 8pt; font-family: ";Tahoma";,";sans-serif";;">Rajeev Kishore. 2010. Mathematical Science Reformulate Convex Relaxation in Logic Based Optimization. J. Exp. Sci. 1(5):25-27.</span></p><p class="MsoNormal" style="margin: 0in 0in 0pt 0.25in; text-indent: -0.25in; text-align: justify;"><span style="font-size: 8pt; font-family: ";Tahoma";,";sans-serif";;"> </span></p> ER -