Formulation of multiple-choice situations in linear programming models using binary coding matrices

DOI10.1016/0377-2217(85)90094-3MaRDI QIDQ1058985zbMATH OpenOpenAlexFDO

Authors Dieter B. Pressmar

Publication date 1985

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(85)90094-3

zbMATH Keywords

combinatorial analysisbinary codingmultiple-choice situations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Integer programming (90C10) Mixed integer programming (90C11)

Recommendations

• Multi-choice probabilistic linear programming problem
• Generalized transformation techniques for multi-choice linear programming problems
• Transformation of a multi-choice linear programming problem
• A binary integer linear program with multi-criteria and multi-constraint levels
• scientific article; zbMATH DE number 4112416
• Multi-choice linear programming for multi-objective bimatrix game
• scientific article; zbMATH DE number 2084733
• A linear programming approach to solving bilinear programmes
• Mathematical programming formulations for two-group classification with binary variables

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3598222 (Why is no real title available?)
• scientific article; zbMATH DE number 3438384 (Why is no real title available?)
• Implementations of special ordered sets in MP software

Cited in

(2)

• Incremental and encoding formulations for mixed integer programming
• Parsimonious binary-encoding in integer programming

Describes a project that uses

Uses Software

• SCICONIC

This page was built for publication: Formulation of multiple-choice situations in linear programming models using binary coding matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1058985)