<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">44587791X</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145533.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110901xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s11081-011-9137-3</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s11081-011-9137-3</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Finding multiple optimal solutions of signomial discrete programming problems with free variables</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Ming-Hua Lin, Jung-Fa Tsai]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">With the increasing reliance on mathematical programming based approaches in various fields, signomial discrete programming (SDP) problems occur frequently in real applications. Since free variables are often introduced to model problems and alternative optima are practical for decision making among multiple strategies, this paper proposes a generalized method to find multiple optimal solutions of SDP problems with free variables. By means of variable substitution and convexification strategies, an SDP problem with free variables is first converted into another convex mixed-integer nonlinear programming problem solvable to obtain an exactly global optimum. Then a general cut is utilized to exclude the previous solution and an algorithm is developed to locate all alternative optimal solutions. Finally, several illustrative examples are presented to demonstrate the effectiveness of the proposed approach.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media, LLC, 2011</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Global optimization</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Signomial discrete programming</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Free variables</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Multiple solutions</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Lin</subfield>
   <subfield code="D">Ming-Hua</subfield>
   <subfield code="u">Department of Information Technology and Management, Shih Chien University, No. 70, Ta-Chih Street, 10462, Taipei, Taiwan</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Tsai</subfield>
   <subfield code="D">Jung-Fa</subfield>
   <subfield code="u">Department of Business Management, National Taipei University of Technology, No. 1, Sec. 3, Chung-Hsiao E. Road, 10608, Taipei, Taiwan</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Optimization and Engineering</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">12/3(2011-09-01), 425-443</subfield>
   <subfield code="x">1389-4420</subfield>
   <subfield code="q">12:3&lt;425</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">12</subfield>
   <subfield code="o">11081</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s11081-011-9137-3</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s11081-011-9137-3</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Lin</subfield>
   <subfield code="D">Ming-Hua</subfield>
   <subfield code="u">Department of Information Technology and Management, Shih Chien University, No. 70, Ta-Chih Street, 10462, Taipei, Taiwan</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Tsai</subfield>
   <subfield code="D">Jung-Fa</subfield>
   <subfield code="u">Department of Business Management, National Taipei University of Technology, No. 1, Sec. 3, Chung-Hsiao E. Road, 10608, Taipei, Taiwan</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Optimization and Engineering</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">12/3(2011-09-01), 425-443</subfield>
   <subfield code="x">1389-4420</subfield>
   <subfield code="q">12:3&lt;425</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">12</subfield>
   <subfield code="o">11081</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
