Characterization of optimality in convex programming without a constraint qualification:
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Buch |
Sprache: | Undetermined |
Veröffentlicht: |
Austin, Texas
1974
|
Ausgabe: | Rev. |
Schriftenreihe: | Center for Cybernetic Studies <Austin, Tex.>: Research report CCS
210 |
Beschreibung: | 29 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010068221 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 950224s1974 |||| 00||| undod | ||
035 | |a (OCoLC)633670217 | ||
035 | |a (DE-599)BVBBV010068221 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | |a und | ||
100 | 1 | |a Ben-Tal, Aharon |e Verfasser |4 aut | |
245 | 1 | 0 | |a Characterization of optimality in convex programming without a constraint qualification |c A. Ben-Tal : A. Ben-Israel ; S. Zlobec |
250 | |a Rev. | ||
264 | 1 | |a Austin, Texas |c 1974 | |
300 | |a 29 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Center for Cybernetic Studies <Austin, Tex.>: Research report CCS |v 210 | |
700 | 1 | |a Ben-Israel, Adi |e Verfasser |4 aut | |
700 | 1 | |a Zlobec, Sanjo |e Verfasser |4 aut | |
830 | 0 | |a Center for Cybernetic Studies <Austin, Tex.>: Research report CCS |v 210 |w (DE-604)BV009868685 |9 210 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006681375 |
Datensatz im Suchindex
_version_ | 1804124454681313280 |
---|---|
any_adam_object | |
author | Ben-Tal, Aharon Ben-Israel, Adi Zlobec, Sanjo |
author_facet | Ben-Tal, Aharon Ben-Israel, Adi Zlobec, Sanjo |
author_role | aut aut aut |
author_sort | Ben-Tal, Aharon |
author_variant | a b t abt a b i abi s z sz |
building | Verbundindex |
bvnumber | BV010068221 |
ctrlnum | (OCoLC)633670217 (DE-599)BVBBV010068221 |
edition | Rev. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01002nam a2200289 cb4500</leader><controlfield tag="001">BV010068221</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950224s1974 |||| 00||| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)633670217</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010068221</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ben-Tal, Aharon</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Characterization of optimality in convex programming without a constraint qualification</subfield><subfield code="c">A. Ben-Tal : A. Ben-Israel ; S. Zlobec</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Rev.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Austin, Texas</subfield><subfield code="c">1974</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">29 S.</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">Center for Cybernetic Studies <Austin, Tex.>: Research report CCS</subfield><subfield code="v">210</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ben-Israel, Adi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zlobec, Sanjo</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Center for Cybernetic Studies <Austin, Tex.>: Research report CCS</subfield><subfield code="v">210</subfield><subfield code="w">(DE-604)BV009868685</subfield><subfield code="9">210</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006681375</subfield></datafield></record></collection> |
id | DE-604.BV010068221 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:45:55Z |
institution | BVB |
language | Undetermined |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006681375 |
oclc_num | 633670217 |
open_access_boolean | |
physical | 29 S. |
publishDate | 1974 |
publishDateSearch | 1974 |
publishDateSort | 1974 |
record_format | marc |
series | Center for Cybernetic Studies <Austin, Tex.>: Research report CCS |
series2 | Center for Cybernetic Studies <Austin, Tex.>: Research report CCS |
spelling | Ben-Tal, Aharon Verfasser aut Characterization of optimality in convex programming without a constraint qualification A. Ben-Tal : A. Ben-Israel ; S. Zlobec Rev. Austin, Texas 1974 29 S. txt rdacontent n rdamedia nc rdacarrier Center for Cybernetic Studies <Austin, Tex.>: Research report CCS 210 Ben-Israel, Adi Verfasser aut Zlobec, Sanjo Verfasser aut Center for Cybernetic Studies <Austin, Tex.>: Research report CCS 210 (DE-604)BV009868685 210 |
spellingShingle | Ben-Tal, Aharon Ben-Israel, Adi Zlobec, Sanjo Characterization of optimality in convex programming without a constraint qualification Center for Cybernetic Studies <Austin, Tex.>: Research report CCS |
title | Characterization of optimality in convex programming without a constraint qualification |
title_auth | Characterization of optimality in convex programming without a constraint qualification |
title_exact_search | Characterization of optimality in convex programming without a constraint qualification |
title_full | Characterization of optimality in convex programming without a constraint qualification A. Ben-Tal : A. Ben-Israel ; S. Zlobec |
title_fullStr | Characterization of optimality in convex programming without a constraint qualification A. Ben-Tal : A. Ben-Israel ; S. Zlobec |
title_full_unstemmed | Characterization of optimality in convex programming without a constraint qualification A. Ben-Tal : A. Ben-Israel ; S. Zlobec |
title_short | Characterization of optimality in convex programming without a constraint qualification |
title_sort | characterization of optimality in convex programming without a constraint qualification |
volume_link | (DE-604)BV009868685 |
work_keys_str_mv | AT bentalaharon characterizationofoptimalityinconvexprogrammingwithoutaconstraintqualification AT benisraeladi characterizationofoptimalityinconvexprogrammingwithoutaconstraintqualification AT zlobecsanjo characterizationofoptimalityinconvexprogrammingwithoutaconstraintqualification |