Solving Problems with Min-Type Functions by Disjunctive Programming

Authors:
Mikhail Andramonov
Affiliations:
Institute of Mathematics and Mechanics, Universitetskaya St 17, 420008, Kazan, Russia
Venue:
Journal of Global Optimization
Year:
2002

Citing 4
Cited 0

Hamiltonian cycles and Markov chains

Mathematics of Operations Research
Increasing convex-along-rays functions with applications to global optimizations

Journal of Optimization Theory and Applications
Minimizing Increasing Star-shaped Functions Based on Abstract Convexity

Journal of Global Optimization
Cutting Angle Method and a Local Search

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.