Zwei Lösungsmethoden für nichtkonvexe Programmierungsprobleme:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Berlin [u.a.]
Springer
1971
|
| Schriftenreihe: | Lecture notes in operations research and mathematical systems
41 |
| Schlagworte: | |
| Beschreibung: | IV, 92 S. graph. Darst. |
| ISBN: | 3540054154 0387054154 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV003098656 | ||
| 003 | DE-604 | ||
| 005 | 20080702 | ||
| 007 | t | ||
| 008 | 900725s1971 d||| |||| 00||| ger d | ||
| 020 | |a 3540054154 |9 3-540-05415-4 | ||
| 020 | |a 0387054154 |9 0-387-05415-4 | ||
| 035 | |a (OCoLC)365289 | ||
| 035 | |a (DE-599)BVBBV003098656 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 049 | |a DE-12 |a DE-384 |a DE-91 |a DE-91G |a DE-473 |a DE-739 |a DE-355 |a DE-29T |a DE-19 |a DE-703 |a DE-20 |a DE-83 |a DE-706 |a DE-188 |a DE-B1550 |a DE-210 | ||
| 050 | 0 | |a HD30 | |
| 050 | 0 | |a T57.8 | |
| 082 | 0 | |a 519.7 | |
| 084 | |a QH 400 |0 (DE-625)141571: |2 rvk | ||
| 084 | |a QH 425 |0 (DE-625)141579: |2 rvk | ||
| 084 | |a SI 853 |0 (DE-625)143200: |2 rvk | ||
| 084 | |a 90C30 |2 msc | ||
| 100 | 1 | |a Ueing, Udo |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Zwei Lösungsmethoden für nichtkonvexe Programmierungsprobleme |c Udo Ueing |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1971 | |
| 300 | |a IV, 92 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in operations research and mathematical systems |v 41 | |
| 650 | 4 | |a Programmation non linéaire | |
| 650 | 7 | |a Programmation non linéaire |2 ram | |
| 650 | 7 | |a combinatoire |2 inriac | |
| 650 | 7 | |a formalisme opérateur |2 inriac | |
| 650 | 7 | |a méthode gradient modifié |2 inriac | |
| 650 | 7 | |a opérateur vectoriel |2 inriac | |
| 650 | 7 | |a ordinateur |2 inriac | |
| 650 | 7 | |a production programme |2 inriac | |
| 650 | 7 | |a programmation non convexe |2 inriac | |
| 650 | 7 | |a restriction linéaire |2 inriac | |
| 650 | 7 | |a schéma niveau |2 inriac | |
| 650 | 4 | |a Nonlinear programming | |
| 650 | 0 | 7 | |a Nichtkonvexe Optimierung |0 (DE-588)4309215-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Nichtkonvexe Optimierung |0 (DE-588)4309215-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 1 | |5 DE-604 | |
| 830 | 0 | |a Lecture notes in operations research and mathematical systems |v 41 |w (DE-604)BV000893609 |9 41 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-001943104 | ||
| 980 | 4 | |a (DE-12)AK22560208 | |
Datensatz im Suchindex
| _version_ | 1804117387085086720 |
|---|---|
| any_adam_object | |
| author | Ueing, Udo |
| author_facet | Ueing, Udo |
| author_role | aut |
| author_sort | Ueing, Udo |
| author_variant | u u uu |
| building | Verbundindex |
| bvnumber | BV003098656 |
| callnumber-first | H - Social Science |
| callnumber-label | HD30 |
| callnumber-raw | HD30 T57.8 |
| callnumber-search | HD30 T57.8 |
| callnumber-sort | HD 230 |
| callnumber-subject | HD - Industries, Land Use, Labor |
| classification_rvk | QH 400 QH 425 SI 853 |
| ctrlnum | (OCoLC)365289 (DE-599)BVBBV003098656 |
| dewey-full | 519.7 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.7 |
| dewey-search | 519.7 |
| dewey-sort | 3519.7 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik Wirtschaftswissenschaften |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02150nam a2200601 cb4500</leader><controlfield tag="001">BV003098656</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20080702 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900725s1971 d||| |||| 00||| ger d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540054154</subfield><subfield code="9">3-540-05415-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387054154</subfield><subfield code="9">0-387-05415-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)365289</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV003098656</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-B1550</subfield><subfield code="a">DE-210</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">HD30</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.8</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.7</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 400</subfield><subfield code="0">(DE-625)141571:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 425</subfield><subfield code="0">(DE-625)141579:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 853</subfield><subfield code="0">(DE-625)143200:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90C30</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ueing, Udo</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Zwei Lösungsmethoden für nichtkonvexe Programmierungsprobleme</subfield><subfield code="c">Udo Ueing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1971</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IV, 92 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in operations research and mathematical systems</subfield><subfield code="v">41</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation non linéaire</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programmation non linéaire</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">combinatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">formalisme opérateur</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">méthode gradient modifié</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">opérateur vectoriel</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">ordinateur</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">production programme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">programmation non convexe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">restriction linéaire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">schéma niveau</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Nonlinear programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Nichtkonvexe Optimierung</subfield><subfield code="0">(DE-588)4309215-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Nichtkonvexe Optimierung</subfield><subfield code="0">(DE-588)4309215-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in operations research and mathematical systems</subfield><subfield code="v">41</subfield><subfield code="w">(DE-604)BV000893609</subfield><subfield code="9">41</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001943104</subfield></datafield><datafield tag="980" ind1="4" ind2=" "><subfield code="a">(DE-12)AK22560208</subfield></datafield></record></collection> |
| id | DE-604.BV003098656 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T15:53:35Z |
| institution | BVB |
| isbn | 3540054154 0387054154 |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001943104 |
| oclc_num | 365289 |
| open_access_boolean | |
| owner | DE-12 DE-384 DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-473 DE-BY-UBG DE-739 DE-355 DE-BY-UBR DE-29T DE-19 DE-BY-UBM DE-703 DE-20 DE-83 DE-706 DE-188 DE-B1550 DE-210 |
| owner_facet | DE-12 DE-384 DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-473 DE-BY-UBG DE-739 DE-355 DE-BY-UBR DE-29T DE-19 DE-BY-UBM DE-703 DE-20 DE-83 DE-706 DE-188 DE-B1550 DE-210 |
| physical | IV, 92 S. graph. Darst. |
| publishDate | 1971 |
| publishDateSearch | 1971 |
| publishDateSort | 1971 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in operations research and mathematical systems |
| series2 | Lecture notes in operations research and mathematical systems |
| spelling | Ueing, Udo Verfasser aut Zwei Lösungsmethoden für nichtkonvexe Programmierungsprobleme Udo Ueing Berlin [u.a.] Springer 1971 IV, 92 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in operations research and mathematical systems 41 Programmation non linéaire Programmation non linéaire ram combinatoire inriac formalisme opérateur inriac méthode gradient modifié inriac opérateur vectoriel inriac ordinateur inriac production programme inriac programmation non convexe inriac restriction linéaire inriac schéma niveau inriac Nonlinear programming Nichtkonvexe Optimierung (DE-588)4309215-9 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Nichtkonvexe Optimierung (DE-588)4309215-9 s DE-604 Optimierung (DE-588)4043664-0 s Lecture notes in operations research and mathematical systems 41 (DE-604)BV000893609 41 |
| spellingShingle | Ueing, Udo Zwei Lösungsmethoden für nichtkonvexe Programmierungsprobleme Lecture notes in operations research and mathematical systems Programmation non linéaire Programmation non linéaire ram combinatoire inriac formalisme opérateur inriac méthode gradient modifié inriac opérateur vectoriel inriac ordinateur inriac production programme inriac programmation non convexe inriac restriction linéaire inriac schéma niveau inriac Nonlinear programming Nichtkonvexe Optimierung (DE-588)4309215-9 gnd Optimierung (DE-588)4043664-0 gnd |
| subject_GND | (DE-588)4309215-9 (DE-588)4043664-0 |
| title | Zwei Lösungsmethoden für nichtkonvexe Programmierungsprobleme |
| title_auth | Zwei Lösungsmethoden für nichtkonvexe Programmierungsprobleme |
| title_exact_search | Zwei Lösungsmethoden für nichtkonvexe Programmierungsprobleme |
| title_full | Zwei Lösungsmethoden für nichtkonvexe Programmierungsprobleme Udo Ueing |
| title_fullStr | Zwei Lösungsmethoden für nichtkonvexe Programmierungsprobleme Udo Ueing |
| title_full_unstemmed | Zwei Lösungsmethoden für nichtkonvexe Programmierungsprobleme Udo Ueing |
| title_short | Zwei Lösungsmethoden für nichtkonvexe Programmierungsprobleme |
| title_sort | zwei losungsmethoden fur nichtkonvexe programmierungsprobleme |
| topic | Programmation non linéaire Programmation non linéaire ram combinatoire inriac formalisme opérateur inriac méthode gradient modifié inriac opérateur vectoriel inriac ordinateur inriac production programme inriac programmation non convexe inriac restriction linéaire inriac schéma niveau inriac Nonlinear programming Nichtkonvexe Optimierung (DE-588)4309215-9 gnd Optimierung (DE-588)4043664-0 gnd |
| topic_facet | Programmation non linéaire combinatoire formalisme opérateur méthode gradient modifié opérateur vectoriel ordinateur production programme programmation non convexe restriction linéaire schéma niveau Nonlinear programming Nichtkonvexe Optimierung Optimierung |
| volume_link | (DE-604)BV000893609 |
| work_keys_str_mv | AT ueingudo zweilosungsmethodenfurnichtkonvexeprogrammierungsprobleme |