A semismooth sequential quadratic programming method for lifted mathematical programs with vanishing constraints

Izmailov, A. F.; Pogosyan, A. L.

doi:10.1134/s0965542511060108

Search citation statements

Order By: Relevance

Paper Sections

Select...

Algorithm Design1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2012

2014

Publication Types

Select...

Article2

Book1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…ITIO problem is a non-linear programming problem with inequality constraints. In this part, we try to solve ITIO problem in many-to-many distribution system with Lagrange Multiplier Method [1,2]. Lagrangian function of ITIO problem in Eq.1 can be expressed as:…”

Section: Algorithm Designmentioning

confidence: 99%

Inventory-Transportation Integrated Optimization Problem in Many-to-Many Distribution Network

Pei

Liu

2012

AMM

View full text Add to dashboard Cite

In order to solve the Inventory-transportation Integrated Optimization problem (ITIO problem) in a distribution network consisting of many warehouses and many retailers, the Lagrange multiplier method, the scenario-based Dynamic Slope Scaling Procedure (DSSP) heuristics and the Lagrangian relaxation-based DSSP heuristics were applied to integrate the system of inventory control and transportation scheduling respectively and in proper sequence. The more efficient Lagrangian relaxation-based DSSP heuristics is found in solving the ITIO problem. And furthermore, the comparative experiments prove the heuristics can get the optimized results in less calculating time and the efficiency of this method is also proved in solving the ITIO problem in a many-to-many distribution network.

show abstract

Section: Algorithm Designmentioning

confidence: 99%