Mathematical Programming: Proceedings of the International Congress on Mathematical Programming, Rio de Janeiro, Brazil, 6-8 April, 1981Richard Cottle, Milton Luiz Kelmanson, Bernhard H. Korte |
Contents
Preface | 1 |
Lifting and Complementing Yields All the Facets of Positive | 13 |
Characterization of Minimal Points and Parametric SemiInfinite | 25 |
Copyright | |
15 other sections not shown
Common terms and phrases
active constraint applied approximate solution assumption Benders bound clique clique problem coefficients contains a hamiltonian convergence convex cycle decentralization Decomposition defined definition denote dual element exists facet feasible solution finite FPAS G₁ given graph greedy greedy algorithm Hamiltonian circuit hamiltonian path Hence hypohamiltonian hypotraceable digraphs implies independence system inequalities integer programming iterations knapsack problem Korte Editors LA,P lattice Lemma linear programming M.L. Kelmanson Math Mathematical Programming matrix minimal cover node North-Holland NP-complete objective function obtained Operations Research optimal solution optimization problems oriented matroid parameter permutation polytope procedure programming problems Proof properties Proposition quadratic assignment problem quadratic programming R.W. Cottle real number resp SAHNI satisfied schedule sequence SIAM simplex method solve subset Suppose Theorem Theory tj+1 travelling salesman problem variables vector vertex