A pivoting algorithm for linear programming with linear complementarity constraints (Q2885465): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Todd S. Munson / rank
Normal rank
 
Property / author
 
Property / author: Todd S. Munson / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AMPL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MacMPEC / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10556788.2010.512956 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091988699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Links between linear bilevel and mixed 0-1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New branch-and-Cut algorithm for bilevel linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplex method of linear programming using LU decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point algorithms, penalty methods and equilibrium problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a modified simplex approach for solving bilevel linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality Measures for Performance Profiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing method for mathematical programs with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing Complementarity Problems in an Algebraic Modeling Language and Communicating Them to Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving mathematical programs with complementarity constraints as nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable modification of explicitLU factors for simplex updates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practicable steepest-edge simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Branch-and-Bound Rules for Linear Bilevel Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Global Solution of Linear Programs with Linear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Complementary Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—The Use of Cuts in Complementary Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential LCP method for bilevel linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The penalty interior-point method fails to converge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity constraints as nonlinear equations: Theory and numerical experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Methods for Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified simplex approach for solving bilevel linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality Conditions for Optimization Problems with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:55, 5 July 2024

scientific article
Language Label Description Also known as
English
A pivoting algorithm for linear programming with linear complementarity constraints
scientific article

    Statements

    A pivoting algorithm for linear programming with linear complementarity constraints (English)
    0 references
    0 references
    0 references
    0 references
    23 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    linear program with complementarity constraints
    0 references
    pivoting method
    0 references
    0 references
    0 references
    0 references
    0 references