Solving Pseudo-Convex Mixed Integer Optimization Problems by Cutting Plane Techniques View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2002-09

AUTHORS

Tapio Westerlund, Ray Pörn

ABSTRACT

In the present paper a cutting plane approach to solve mixed-integer non-linear programming (MINLP) problems, containing pseudo-convex functions, is given. It is shown how valid cutting planes for pseudo convex functions can be obtained and, furthermore, it is shown how a class of non-convex MINLP problems with a pseudo-convex objective function and pseudo-convex constraints, can be solved to global optimality with the considered cutting plane technique. Finally the numerical efficiency of the procedure, when solving some example problems, is illustrated. More... »

PAGES

253-280

References to SciGraph publications

  • 1986-05. Additively decomposed quasiconvex functions in MATHEMATICAL PROGRAMMING
  • 2001. Extended Cutting Plane Algorithm in ENCYCLOPEDIA OF OPTIMIZATION
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1023/a:1021091110342

    DOI

    http://dx.doi.org/10.1023/a:1021091110342

    DIMENSIONS

    https://app.dimensions.ai/details/publication/pub.1018792106


    Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
    Incoming Citations Browse incoming citations for this publication using opencitations.net

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "about": [
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0103", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Numerical and Computational Mathematics", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Mathematical Sciences", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "\u00c5bo Akademi University", 
              "id": "https://www.grid.ac/institutes/grid.13797.3b", 
              "name": [
                "Process Design Laboratory, \u00c5bo Akademi University, Biskopsgatan 8, FIN-20500, \u00c5bo, Finland"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Westerlund", 
            "givenName": "Tapio", 
            "id": "sg:person.07407562150.30", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07407562150.30"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "name": [
                "Swedish Polytechnic, Technology and Communication, Wollfskav\u00e4gen 33, FIN-65200, Vasa, Finland"
              ], 
              "type": "Organization"
            }, 
            "familyName": "P\u00f6rn", 
            "givenName": "Ray", 
            "id": "sg:person.015021556723.56", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015021556723.56"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "https://doi.org/10.1016/0098-1354(96)00080-4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002976036"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0098-1354(00)00622-0", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1009569309"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0098-1354(97)00000-8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1010214691"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0098-1354(90)87085-4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1024387141"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1002/aic.690440714", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025195835"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0098-1354(97)87599-0", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033402298"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0098-1354(95)87027-x", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1034877845"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01589440", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1043168530", 
              "https://doi.org/10.1007/bf01589440"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/0-306-48332-7_126", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1049023844", 
              "https://doi.org/10.1007/0-306-48332-7_126"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0098-1354(98)00238-5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1049144327"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0098-1354(94)00097-2", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1053519295"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1137/0108053", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062837745"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2002-09", 
        "datePublishedReg": "2002-09-01", 
        "description": "In the present paper a cutting plane approach to solve mixed-integer non-linear programming (MINLP) problems, containing pseudo-convex functions, is given. It is shown how valid cutting planes for pseudo convex functions can be obtained and, furthermore, it is shown how a class of non-convex MINLP problems with a pseudo-convex objective function and pseudo-convex constraints, can be solved to global optimality with the considered cutting plane technique. Finally the numerical efficiency of the procedure, when solving some example problems, is illustrated.", 
        "genre": "research_article", 
        "id": "sg:pub.10.1023/a:1021091110342", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": [
          {
            "id": "sg:journal.1136707", 
            "issn": [
              "1389-4420", 
              "1573-2924"
            ], 
            "name": "Optimization and Engineering", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "3", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "3"
          }
        ], 
        "name": "Solving Pseudo-Convex Mixed Integer Optimization Problems by Cutting Plane Techniques", 
        "pagination": "253-280", 
        "productId": [
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "5989c26b703a2482154f02d527f0c072ace61394995926425bbd90f4a77a4d27"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1023/a:1021091110342"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1018792106"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1023/a:1021091110342", 
          "https://app.dimensions.ai/details/publication/pub.1018792106"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2019-04-10T14:07", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8660_00000504.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "http://link.springer.com/10.1023%2FA%3A1021091110342"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1023/a:1021091110342'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1023/a:1021091110342'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1023/a:1021091110342'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1023/a:1021091110342'


     

    This table displays all metadata directly associated to this object as RDF triples.

    108 TRIPLES      21 PREDICATES      39 URIs      19 LITERALS      7 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1023/a:1021091110342 schema:about anzsrc-for:01
    2 anzsrc-for:0103
    3 schema:author N158929337d97455ea05de75577834a6f
    4 schema:citation sg:pub.10.1007/0-306-48332-7_126
    5 sg:pub.10.1007/bf01589440
    6 https://doi.org/10.1002/aic.690440714
    7 https://doi.org/10.1016/0098-1354(90)87085-4
    8 https://doi.org/10.1016/0098-1354(94)00097-2
    9 https://doi.org/10.1016/0098-1354(95)87027-x
    10 https://doi.org/10.1016/0098-1354(96)00080-4
    11 https://doi.org/10.1016/s0098-1354(00)00622-0
    12 https://doi.org/10.1016/s0098-1354(97)00000-8
    13 https://doi.org/10.1016/s0098-1354(97)87599-0
    14 https://doi.org/10.1016/s0098-1354(98)00238-5
    15 https://doi.org/10.1137/0108053
    16 schema:datePublished 2002-09
    17 schema:datePublishedReg 2002-09-01
    18 schema:description In the present paper a cutting plane approach to solve mixed-integer non-linear programming (MINLP) problems, containing pseudo-convex functions, is given. It is shown how valid cutting planes for pseudo convex functions can be obtained and, furthermore, it is shown how a class of non-convex MINLP problems with a pseudo-convex objective function and pseudo-convex constraints, can be solved to global optimality with the considered cutting plane technique. Finally the numerical efficiency of the procedure, when solving some example problems, is illustrated.
    19 schema:genre research_article
    20 schema:inLanguage en
    21 schema:isAccessibleForFree false
    22 schema:isPartOf Na391667d3b6c49cbacf8a71c3f3705f6
    23 Nbde0a1abb1ec470bb56cb3d0df4d9dc8
    24 sg:journal.1136707
    25 schema:name Solving Pseudo-Convex Mixed Integer Optimization Problems by Cutting Plane Techniques
    26 schema:pagination 253-280
    27 schema:productId N5fdc0f34d7034557bea26c380229afd8
    28 Ne935bfb5c2be47f3b23bb47a1eb9b8da
    29 Nfb1e69546242401bba9de3c63e65074e
    30 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018792106
    31 https://doi.org/10.1023/a:1021091110342
    32 schema:sdDatePublished 2019-04-10T14:07
    33 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    34 schema:sdPublisher N6232f34dab964e0f9cd1bf99f85dc67e
    35 schema:url http://link.springer.com/10.1023%2FA%3A1021091110342
    36 sgo:license sg:explorer/license/
    37 sgo:sdDataset articles
    38 rdf:type schema:ScholarlyArticle
    39 N158929337d97455ea05de75577834a6f rdf:first sg:person.07407562150.30
    40 rdf:rest N8885b894beca47a298d1fe322249e0e7
    41 N5fdc0f34d7034557bea26c380229afd8 schema:name dimensions_id
    42 schema:value pub.1018792106
    43 rdf:type schema:PropertyValue
    44 N6232f34dab964e0f9cd1bf99f85dc67e schema:name Springer Nature - SN SciGraph project
    45 rdf:type schema:Organization
    46 N8885b894beca47a298d1fe322249e0e7 rdf:first sg:person.015021556723.56
    47 rdf:rest rdf:nil
    48 Na391667d3b6c49cbacf8a71c3f3705f6 schema:volumeNumber 3
    49 rdf:type schema:PublicationVolume
    50 Nbde0a1abb1ec470bb56cb3d0df4d9dc8 schema:issueNumber 3
    51 rdf:type schema:PublicationIssue
    52 Ncdb56382bb8e4ae592b3b65e17076029 schema:name Swedish Polytechnic, Technology and Communication, Wollfskavägen 33, FIN-65200, Vasa, Finland
    53 rdf:type schema:Organization
    54 Ne935bfb5c2be47f3b23bb47a1eb9b8da schema:name readcube_id
    55 schema:value 5989c26b703a2482154f02d527f0c072ace61394995926425bbd90f4a77a4d27
    56 rdf:type schema:PropertyValue
    57 Nfb1e69546242401bba9de3c63e65074e schema:name doi
    58 schema:value 10.1023/a:1021091110342
    59 rdf:type schema:PropertyValue
    60 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
    61 schema:name Mathematical Sciences
    62 rdf:type schema:DefinedTerm
    63 anzsrc-for:0103 schema:inDefinedTermSet anzsrc-for:
    64 schema:name Numerical and Computational Mathematics
    65 rdf:type schema:DefinedTerm
    66 sg:journal.1136707 schema:issn 1389-4420
    67 1573-2924
    68 schema:name Optimization and Engineering
    69 rdf:type schema:Periodical
    70 sg:person.015021556723.56 schema:affiliation Ncdb56382bb8e4ae592b3b65e17076029
    71 schema:familyName Pörn
    72 schema:givenName Ray
    73 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015021556723.56
    74 rdf:type schema:Person
    75 sg:person.07407562150.30 schema:affiliation https://www.grid.ac/institutes/grid.13797.3b
    76 schema:familyName Westerlund
    77 schema:givenName Tapio
    78 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07407562150.30
    79 rdf:type schema:Person
    80 sg:pub.10.1007/0-306-48332-7_126 schema:sameAs https://app.dimensions.ai/details/publication/pub.1049023844
    81 https://doi.org/10.1007/0-306-48332-7_126
    82 rdf:type schema:CreativeWork
    83 sg:pub.10.1007/bf01589440 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043168530
    84 https://doi.org/10.1007/bf01589440
    85 rdf:type schema:CreativeWork
    86 https://doi.org/10.1002/aic.690440714 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025195835
    87 rdf:type schema:CreativeWork
    88 https://doi.org/10.1016/0098-1354(90)87085-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024387141
    89 rdf:type schema:CreativeWork
    90 https://doi.org/10.1016/0098-1354(94)00097-2 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053519295
    91 rdf:type schema:CreativeWork
    92 https://doi.org/10.1016/0098-1354(95)87027-x schema:sameAs https://app.dimensions.ai/details/publication/pub.1034877845
    93 rdf:type schema:CreativeWork
    94 https://doi.org/10.1016/0098-1354(96)00080-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002976036
    95 rdf:type schema:CreativeWork
    96 https://doi.org/10.1016/s0098-1354(00)00622-0 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009569309
    97 rdf:type schema:CreativeWork
    98 https://doi.org/10.1016/s0098-1354(97)00000-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010214691
    99 rdf:type schema:CreativeWork
    100 https://doi.org/10.1016/s0098-1354(97)87599-0 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033402298
    101 rdf:type schema:CreativeWork
    102 https://doi.org/10.1016/s0098-1354(98)00238-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1049144327
    103 rdf:type schema:CreativeWork
    104 https://doi.org/10.1137/0108053 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062837745
    105 rdf:type schema:CreativeWork
    106 https://www.grid.ac/institutes/grid.13797.3b schema:alternateName Åbo Akademi University
    107 schema:name Process Design Laboratory, Åbo Akademi University, Biskopsgatan 8, FIN-20500, Åbo, Finland
    108 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...