An outer-approximation algorithm for a class of mixed-integer nonlinear programs (Q3757690): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q92557467, #quickstatements; #temporary_batch_1712261475387
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A procedure for new product positioning in an attribute space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A duality theorem and an algorithm for (mixed-) integer nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical Cuts on the Unit Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal short-term scheduling of large-scale power systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A central cutting plane algorithm for the convex programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approach to the Optimal Positioning of a New Product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Large-Scale Mathematical Programming Part I: Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some polyhedra related to combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification of special structure constraints in linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximations algorithm for computer-aided design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-Plane Methods without Nested Constraint Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: ZIPMAP -- A Zero-One Integer Programming Model for Market Segmentation and Product Positioning / rank
 
Normal rank

Revision as of 19:04, 17 June 2024

scientific article
Language Label Description Also known as
English
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
scientific article

    Statements

    An outer-approximation algorithm for a class of mixed-integer nonlinear programs (English)
    0 references
    0 references
    0 references
    1986
    0 references
    computer-aided design
    0 references
    outer-approximation
    0 references
    mixed-integer nonlinear programming
    0 references
    decomposition
    0 references
    relaxation
    0 references
    Convergence
    0 references
    optimality properties
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references