-
Convex biquadratic maximization over a polyhedral convex setIndihar, Stane, 1941-2009V članku je podana končna metoda za reševanje posebnega problema nelinearnega programiranja. Iščemo maksimum konveksne bikvadratne funkcije na kartezičnem produktu dveh konveksnih poliedrskih množic. ... Problem je posplošitev dobro znanega problema bilinearnega programiranja. Predloženo metodo moremo uporabiti za določitev maksimalnega diametra danega politopa.Source: KOI '92 : zbornik radova : proceedings (Str. 55-60)Type of material - conference contributionPublish date - 1992Language - englishCOBISS.SI-ID - 4350980
Author
Indihar, Stane, 1941-2009
Topics
nelinearno programiranje |
linearno programiranje |
maksimizacija |
množice |
funkcije |
metode |
polieder |
konveksna kvadratna maksimizacija |
konvekcija |
konvekcija |
nonlinear programming |
linear programming |
maximization |
sets |
functions |
methods |
polyhedron |
convex quadratic maximization |
convexity |
convection
![loading ... loading ...](themes/default/img/ajax-loading.gif)
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.