Infinite Programming / Najlacnejšie knihy
Infinite Programming

Kód: 06622380

Infinite Programming

Autor Edward J. Anderson, Andrew B. Philpott

Infinite programming may be defined as the study of mathematical programming problems in which the number of variables and the number of constraints are both possibly infinite. Many optimization problems in engineering, operations ... celý popis

109.45


Skladom u dodávateľa v malom množstve
Odosielame za 13 - 18 dní

Potrebujete viac kusov?Ak máte záujem o viac kusov, preverte, prosím, najprv dostupnosť titulu na našej zákazníckej podpore.


Pridať medzi želanie

Mohlo by sa vám tiež páčiť

Darčekový poukaz: Radosť zaručená
  1. Darujte poukaz v ľubovoľnej hodnote, a my sa postaráme o zvyšok.
  2. Poukaz sa vzťahuje na všetky produkty v našej ponuke.
  3. Elektronický poukaz si vytlačíte z e-mailu a môžete ho ihneď darovať.
  4. Platnosť poukazu je 12 mesiacov od dátumu vystavenia.

Objednať darčekový poukazViac informácií

Viac informácií o knihe Infinite Programming

Nákupom získate 265 bodov

Anotácia knihy

Infinite programming may be defined as the study of mathematical programming problems in which the number of variables and the number of constraints are both possibly infinite. Many optimization problems in engineering, operations research, and economics have natural formul- ions as infinite programs. For example, the problem of Chebyshev approximation can be posed as a linear program with an infinite number of constraints. Formally, given continuous functions f,gl,g2, ,gn on the interval [a,b], we can find the linear combination of the functions gl,g2, ... ,gn which is the best uniform approximation to f by choosing real numbers a,xl,x2, .. ,x to n minimize a t [a,b]. This is an example of a semi-infinite program; the number of variables is finite and the number of constraints is infinite. An example of an infinite program in which the number of constraints and the number of variables are both infinite, is the well-known continuous linear program which can be formulated as follows. T minimize ~ c(t)Tx(t)dt t b(t) , subject to Bx(t) + fo Kx(s)ds x(t) .. 0, t [0, T] If x is regarded as a member of some infinite-dimensional vector space of functions, then this problem is a linear program posed over that space. Observe that if the constraint equations are differentiated, then this problem takes the form of a linear optimal control problem with state IV variable inequality constraints.

Parametre knihy

Zaradenie knihy Knihy po anglicky Economics, finance, business & management Economics Economic theory & philosophy

109.45

Obľúbené z iného súdka



Osobný odber Bratislava a 12742 dalších

Copyright ©2008-26 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies


Môj účet: Prihlásiť sa
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Nákupný košík ( prázdny )

Vyzdvihnutie v Zásielkovni
zadarmo nad 59,99 €.

Nachádzate sa: