Symmetric duality for disjunctive programming with absolute value functionals (Q1078070): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5627917 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructive Group Relaxations for Integer Programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved integer programming bounds using intersections of corner polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Convergent Duality Theory for Integer Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I / rank | |||
Normal rank |
Latest revision as of 13:55, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Symmetric duality for disjunctive programming with absolute value functionals |
scientific article |
Statements
Symmetric duality for disjunctive programming with absolute value functionals (English)
0 references
1986
0 references
A duality theory for disjunctive linear programming problems of special kind is suggested. There is no duality gap between the solutions of the pair of dual problems constructed. This idea is extended to zero-one and integer problems.
0 references
absolute value functionals
0 references
disjunctive linear programming
0 references