Linearly constrained global optimization: a general solution algorithm with applications.

90C26: Nonconvex programming, global optimization

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

Uses Software

KELLEY
MarPlex

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A complete algorithm for linear fractional programs
The simplex method and unrestricted variables
A collection of test problems for constrained global optimization algorithms
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
An algorithm for enumerating all vertices of a convex polyhedron
A practical anti-cycling procedure for linearly constrained optimization
Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm
Affine geometric method for linear programs
Primal-dual methods for vertex and facet enumeration
Enumerating extreme points of a highly degenerate polytope
Simultaneous determination of capacities and load in parallel \(M/M/1\) queues
Some results concerning post-infeasibility analysis
Combinatorial face enumeration in convex polytopes
Formulation assistance for global optimization problems
A mathematical programming approach to clusterwise regression model and its extensions
A linear fractional program with homogeneous constraints.
Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
An algorithm for determining all extreme points of a convex polytope
Lectures on Polytopes
Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
A comprehensive simplex-like algorithm for network optimization and perturbation analysis
Constraint exploration method for quadratic programming problem.