mdmFacet
Apr May 2024 Jun
MoTuWeThFrSaSu
   1  2  3  4  5
  6  7  8  9101112
13141516171819
20212223242526
2728293031 

Detail

EuropeanaInformation 
Raw data [ X ]
<section name="raw">
    <SEQUENTIAL>
      <record key="001" att1="001" value="LIB902133500" att2="LIB902133500">001   LIB902133500</record>
      <field key="037" subkey="x">englisch</field>
      <field key="050" subkey="x">Buch</field>
      <field key="076" subkey="">Formalwissenschaft</field>
      <field key="100" subkey="">canon, michael d.</field>
      <field key="104" subkey="a">cullum, clifton d., jr.</field>
      <field key="108" subkey="a">polak, elijah</field>
      <field key="331" subkey="">theory of optimal control and mathematical programming</field>
      <field key="403" subkey="">1. ed.</field>
      <field key="410" subkey="">new york, san francisco, st. louis</field>
      <field key="412" subkey="">mcgraw-hill book company</field>
      <field key="425" subkey="">1970</field>
      <field key="433" subkey="">xii, 285 pp.</field>
      <field key="451" subkey="">mcgraw-hill series in systems science</field>
      <field key="451" subkey="h">balakrishnan, a.v. (ed.) ; dantzig, george (ed.) ; zadeh, lotfi (ed.)</field>
      <field key="517" subkey="c">from the table of contents: problem formulation; conditions of optimality for the basic problem; some necessary and some</field>
      <field key="suf" subkey="f">icient conditions for nonlinear programming; discrete optimal control problems; optimal control and linear programming;</field>
      <field key="opt" subkey="i">mal control and quadratic programming; convex programming algorithms; free-end-time optimal control problems; appendixes;</field>
      <field key="544" subkey="">4765-A</field>
    </SEQUENTIAL>
  </section>
Servertime: 0.073 sec | Clienttime: sec