-
A generalization of bilinear programmingIndihar, Stane, 1941-2009V delu je dana končna metoda za reševanje problema nelinearnega programiranja ▫${\rm max} \{f(x,y)|x\in X, y\in Y\}$▫, kjer je ▫$f(x,y)$▫ vsota konveksne kvadratne funkcije po ▫$x$▫, konveksne ... kvadratne funkcije po ▫$y$▫ in bilinearne forme. Dopustni množici ▫$X$▫ in ▫$Y$▫ sta omejena ali neomejena poliedra. Dobro znani problem bilinearnega programiranja poseben primer problema (P). Predloženo metodo za reševanje problema (P) moremo uporabiti za določitev maksimalnega diametra omejenega poliedra.Source: 1st Balkan Conference on Operational Research : proceedings : Thessaloniki 17-20 oktober 1988 (Str. 326-335)Type of material - conference contributionPublish date - 1990Language - englishCOBISS.SI-ID - 3013124
Author
Indihar, Stane, 1941-2009
Topics
matematika |
matematično programiranje |
konveksna maksimizacija |
bilinearno programiranje |
konveksna kvadratna funkcija |
polieder |
simpleksni algoritem |
mathematics |
mathematical programming |
convex maximization |
bilinear programming |
convex square function |
polyhedron |
simplex algorithm
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|---|
Indihar, Stane, 1941-2009 | 00823 |
Select pickup location:
Material pickup by post
Notification
Subject headings in COBISS General List of Subject Headings
Select pickup location
Pickup location | Material status | Reservation |
---|
Please wait a moment.