Northwestern University

Parent Unit Name

Login

LIBRARIES | ARCH

Menu Search

Start Over

Filtering by: Keyword Algorithms Keyword Bilevel programming Keyword difference of convex Keyword global optimization

1 entry found

List Gallery Masonry Slideshow

8g84mm50n?file=thumbnail

1. Methods for Linear Programs with Complementarity Constraints

Description:: This thesis studies three approaches for solving linear programs with complementarity constraints (LPCC). The focus of Chapter 2 lies on difference-of-convex (DC) penalty formulations and the associated difference-of-convex algorithm (DCA) for computing stationary solutions of LPCCs. We concentrate on three such formulations and establish connections between their stationary solutions and...
Keyword:: Algorithms, Bilevel programming, global optimization, stationary, difference of convex, and Complementarity constraints
Subject:: Industrial Engineering and Management Sciences
Creator:: Francisco Ivan Jara Moroni
Owner:: Scholarly Digital Publishing
Date Uploaded:: 10/14/2019
Date Modified:: 10/14/2019
Date Created:: 2018-01-01
Resource Type:: Dissertation