Duality in mathematics and linear and integer programming
From MaRDI portal
Publication:2565013
DOI10.1007/BF02189998zbMath0866.90089MaRDI QIDQ2565013
Publication date: 20 July 1997
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items (8)
A Partitioning Method that Generates Interpretable Prices for Integer Programming Problems ⋮ Equilibrium prices supported by dual price functions in markets with non-convexities ⋮ Efficient market-clearing prices in markets with nonconvexities ⋮ Compact bidding languages and supplier selection for markets with economies of scale and scope ⋮ Towards strong duality in integer programming ⋮ A Unified Framework for Multistage Mixed Integer Linear Optimization ⋮ Generalized nonlinear Lagrangian formulation for bounded integer programming ⋮ A nonlinear Lagrangian dual for integer programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A duality theorem for linear congruences
- Total dual integrality and integer polyhedra
- Partitioning procedures for solving mixed-variables programming problems
- A characterisation of all feasible solutions to an integer program
- The value function of a mixed integer program: I
- The value function of a mixed integer program. II
- Constructing the value function for an integer linear programme over a cone
- Edmonds polytopes and a hierarchy of combinatorial problems
- Integer Programming and Pricing
- Integer programming duality: Price functions and sensitivity analysis
- An elementary survey of general duality theory in mathematical programming
- The value function of an integer program
- Concepts of optimality and their uses
- A Theorem Concerning the Integer Lattice
- Convex Analysis
- Surrogate Mathematical Programming
- Blocking and anti-blocking pairs of polyhedra
This page was built for publication: Duality in mathematics and linear and integer programming
