skip to content
A dual and interior point approach to solve convex min-max problems Preview this item
ClosePreview this item
Checking...

A dual and interior point approach to solve convex min-max problems

Author: Jos F Sturm; Shuzhong Zhang
Publisher: Amsterdam : Tinbergen Institute, [1995]
Series: Discussion paper / Tinbergen Institute, TI 95-15. Operations research and decision analysis; Discussion paper, TI 95-15.
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Jos F Sturm; Shuzhong Zhang
OCLC Number: 69156010
Description: 11 p. ; 30 cm.
Series Title: Discussion paper / Tinbergen Institute, TI 95-15. Operations research and decision analysis; Discussion paper, TI 95-15.
Responsibility: Jos F. Sturm, Shuzhong Zhang.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/69156010> # A dual and interior point approach to solve convex min-max problems
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "69156010" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/151500813#Place/amsterdam> ; # Amsterdam
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/ne> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/151500813#Topic/minimax_problemen> ; # Minimax problemen
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://experiment.worldcat.org/entity/work/data/151500813#Person/zhang_shuzhong> ; # Shuzhong Zhang
    schema:creator <http://viaf.org/viaf/197222026> ; # Jos F. Sturm
    schema:datePublished "1995" ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/151500813> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://worldcat.org/issn/0929-0834> ; # Discussion paper ;
    schema:name "A dual and interior point approach to solve convex min-max problems" ;
    schema:numberOfPages "11" ;
    schema:productID "69156010" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/69156010#PublicationEvent/amsterdam_tinbergen_institute_1995> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/151500813#Agent/tinbergen_institute> ; # Tinbergen Institute
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/69156010> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/151500813#Agent/tinbergen_institute> # Tinbergen Institute
    a bgn:Agent ;
    schema:name "Tinbergen Institute" ;
    .

<http://experiment.worldcat.org/entity/work/data/151500813#Person/zhang_shuzhong> # Shuzhong Zhang
    a schema:Person ;
    schema:familyName "Zhang" ;
    schema:givenName "Shuzhong" ;
    schema:name "Shuzhong Zhang" ;
    .

<http://experiment.worldcat.org/entity/work/data/151500813#Topic/minimax_problemen> # Minimax problemen
    a schema:Intangible ;
    schema:name "Minimax problemen" ;
    .

<http://viaf.org/viaf/197222026> # Jos F. Sturm
    a schema:Person ;
    schema:birthDate "1971" ;
    schema:deathDate "2003" ;
    schema:familyName "Sturm" ;
    schema:givenName "Jos F." ;
    schema:name "Jos F. Sturm" ;
    .

<http://worldcat.org/issn/0929-0834> # Discussion paper ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/69156010> ; # A dual and interior point approach to solve convex min-max problems
    schema:issn "0929-0834" ;
    schema:name "Discussion paper ;" ;
    schema:name "Discussion paper," ;
    schema:name "Discussion paper / Tinbergen Institute," ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.