COR@L Seminar Series 2005-06
Introduction
Coral Seminar Series is a series of weekly seminars focussing on Optimization.
These informal seminars are usually held on every Thursday 12:00-1:00pm in room
Mo355. Anyone interested in a particular seminar or mathematical programming
and optimization in general is welcome. Attendees are encouraged to bring their
lunch. Important announcements and discussions about the seminar are made on
the
seminar
mailing list, which is open to everyone for subscription.
If you wish to contribute a talk on your own research in optimization
send an email with a short description of your topic to
Menal Guzelsoy and/or
Ashutosh Mahajan.
Summer 2006 Presentations
Following is a list of presentations done during the summer of 2006, along with the
slides and references.
| Date: | Thursday, 05/25/2006
|
|---|
| Speaker: | Larry Snyder
|
|---|
| Topic: | Beer Game
|
|---|
Spring 2006 Presentations
Following is a list of presentations done during the spring semester, 2006, along with the
slides and suggested readings.
| Date: | Thursday, 05/11/2006
|
|---|
| Speaker: | Jerry Shen
|
|---|
| Topic: | PhD proposal presentation: Solving Multistage Stochastic Linear Programs on the Computational Grid [PDF]
|
|---|
| Date: | Tuesday, 04/11/2006
|
|---|
| Speaker: | Menal Guzelsoy
|
|---|
| Topic: | PhD proposal presentation: Duality, Warm Starting and Sensitivity Analysis in Mixed-Integer Programming. [PDF]
|
|---|
| Date: | Thursday, 04/06/2006
|
|---|
| Speaker: | Zeliha Akca
|
|---|
| Topic: | PhD proposal presentation: Integrated Location Routing and Scheduling Problems: Models and Algorithms [PDF]
|
|---|
| Date: | Thursday, 03/23/2006
|
|---|
| Speaker: | Ali Pilatin
|
|---|
| Topic: | Heuristics in VRP [Unavailable]
|
|---|
| Date: | Thursday, 03/23/2006
|
|---|
| Speaker: | Kumar Abhishek
|
|---|
| Topic: | Block Layout Design Problem - A MINLP formulation. [Unavailable]
|
|---|
- References:
-
I. Castillo, J. Westerlund, S. Emet, and T. Westerlund, Optimization of block layout design problems with unequal areas: A comparison of milp and minlp optimization methods, Computers and Chemical Engineering, 30 (2005), pp. 54-69. [ScienceDirect]
- H.D.Sherali, B.M.P.Fraticelli and R.D.Meller, Enhanced Model Formulations for Optimal Facility Layout, Operations Research, Vol. 51, No. 4. [Extenza]
| Date: | Thursday, 03/16/2006
|
|---|
| Speaker: | Jerry Shen, Wasu Glankwamdee
|
|---|
| Topic: | Rescheduling Bulk Gas Production and Distribution [Unavailable]
|
|---|
| Date: | Thursdays, 03/09/2006
|
|---|
| Speaker: | Kumar Abhishek
|
|---|
| Topic: | Topics in Mixed Integer Nonlinear Programming (Ph.D Proposal) [Unavailable]
|
|---|
- Summary:
-
A Mixed Integer Nonlinear Program (MINLP) is the problem of
minimizing
a nonlinear function subject to nonlinear constraints and integrality
restrictions on some or all of the decision variables. MINLP is one
of the most fundamentally challenging problems in optimization, its
difficulty arising from the combination of functional nonlinearities
and nonconvexity induced by integrality restrictions. Nevertheless,
MINLP is a tremendously important problem, with many important
applications having MINLP models. The main focus of this thesis is
on convex MINLP models, where the objective function is convex,
and the points that satisfy the nonlinear constraints form a convex
set.
First, we discuss how to implement a (known) linearization-based
algorithm (known as LP/NLP branch-and-bound) using existing software
components for mixed integer linear programming (MILP) branch-and-cut
and (continuous) nonlinear programming. The result of this
work will be a powerful and flexible software package for
MINLP---competitive with all other known software available for this
problem class.
The second portion of the thesis deals with cutting planes. We provide
an insight that allows us to generate new classes of cutting planes.
| Date: | Thursdays, 02/02/2006 and 02/09/2006
|
|---|
| Speaker: | Ashutosh Mahajan
|
|---|
| Topic: | Bundle Methods in Optimization [Part 1, Part 2 (PDFs)]
|
|---|
- References:
-
C.Paolo, F.Antonio and N.Maddalena, Applying Bundle Methods to the Optimization of Polyhedral Functions: An Applications-Oriented Development, Technical Report, TR-96-17, December 01, 1997, University of Pisa.
| Date: | Thursdays, 01/19/2006 and 01/26/2006
|
|---|
| Speaker: | Scott DeNegre
|
|---|
| Topic: | Bicriteria Programming and Zero-sum Stackelberg Games [PDF].
|
|---|
- References:
-
Included in presentation.
Fall 2005 Presentations
Following is a list of presentations done during this semester, along with the
slides and suggested readings.
| Date: | Thursday, 11/17/2005
|
|---|
| Speaker: | Zeliha Akca
|
|---|
| Topic: | Column Basis Reduction and Decomposible Knapsack Problems [PDF]
|
|---|
- References:
-
B. Krishnamoorthy and G. Pataki, Column Basis Reduction and Decomposible Knapsack Problems. [PDF]
| Date: | Thursday, 11/10/2005
|
|---|
| Speaker: | Jeff Linderoth
|
|---|
| Topic: | Reformulation and Sampling to solve a Stochastic Network Interdiction Problem [PDF]
|
|---|
| Date: | Thursday, 11/03/2005
|
|---|
| Speaker: | Ted Ralphs
|
|---|
| Topic: | Biobjective Integer Programming [PDF]
|
|---|
| Date: | Thursdays, 10/20/2005 and 10/27/2005
|
|---|
| Speaker: | Menal Guzelsoy
|
|---|
| Topic: | A non standard approach to duality [PDF]
|
|---|
- Suggested Reading:
-
Jean B. Lasserre, Duality and a Farkas lemma for integer programs, Optimization: Structure and Applications (E. Hunt and C.E.M. Pearce, Editors), Kluwer Academic Publishers, 2004.
-
Jean B. Lasserre, Integer Programming duality and superadditive functions, Contemporary Mathematics, 374, pp.139-150, 2005.
| Date: | Thursdays, 10/06/2005 and 10/13/2005
|
|---|
| Speaker: | Wasu Glankwamdee, Jerry Shen.
|
|---|
| Topic: | Using Split Disjunctions to improve the formulation of MILPs [PDF]
|
|---|
- Suggested Reading:
-
Kent Andersen, Using split disjunctions to improve the formulation of a mixed integer linear program. [PS]
-
| Date: | Thursdays, 09/22/2005 and 09/29/2005
|
|---|
| Speaker: | Mustafa Kilinc, Ali Pilatin
|
|---|
| Topic: | Correspondence between classes of cuts [PDF]
|
|---|
- Suggested Reading:
-
Egon Balas, Michael Perregard. A precise Correspondence Between Lift-and-Project-Cuts, Simple Disjunctive Cuts, and Mixed Integer Gomory Cuts for 0-1 Programming, August 2000. [PS]
-
| Date: | Thursday, 09/15/2005
|
|---|
| Speaker: | Jim Ostrowski
|
|---|
| Topic: | Exploiting orbits in symmetric ILP [PDF]
|
|---|
- Suggested Reading:
-
François Margot, Exploiting orbits in symmetric ILP, Mathematical Programming, Volume 98, Issue 1 - 3, Sep 2003, Page 3 [Springer]
-
| Date: | Thursday, 09/08/2005
|
|---|
| Speaker: | Kumar Abhishek, Ashutosh Mahajan
|
|---|
| Topic: | Primal Heuristics: Feasibility Pump and OCTANE [PDF]
|
|---|
- Suggested Reading:
-
Matteo Fischetti, Fred Glover, Andrea Lodi The Feasibility Pump, Math. Programming Series A, March 2005
[PDF]
-
Egon Balas, Sebastian Ceria, Milind Dawande, Francis Margot, Gabor Pataki.
OCTANE: A new heuristic for pure 0-1 programs, Operations Research, Vol
49, No. 2, pages 207-225.
[PDF]
Archives
Seminar Series 2004-2005
Seminar Series 2003-2004
Last Updated: Sept 10, 2005