Generalized transformation techniques for multi-choice linear programming problems

DOI10.11121/IJOCTA.01.2013.00132MaRDI QIDQ2935666zbMATH OpenOpenAlexFDO

Authors M. Acharya, S. Acharya

Publication date 30 December 2014

Published in An International Journal of Optimization and Control: Theories & Applications (IJOCTA) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.11121/ijocta.01.2013.00132

zbMATH Keywords

linear programmingnonlinear programmingmixed integer programmingmulti-choice programmingtransformation technique

Mathematics Subject Classification ID

Linear programming (90C05) Nonlinear programming (90C30) Mixed integer programming (90C11)

Recommendations

• Transformation of a multi-choice linear programming problem
• Multi-choice multi-objective linear programming problem
• Multi-choice probabilistic linear programming problem
• Solving multi-choice linear programming problems by interpolating polynomials
• Multi-level linear programming problem involving some multi-choice parameters

Cited in

(7)

• A decision-maker confidence level based multi-choice best-worst method: an MCDM approach
• Transformation of a multi-choice linear programming problem
• Computation of a multi-choice goal programming problem
• The transformation technique for a class of variable upper bounding constraints in linear programming
• Multi-choice probabilistic linear programming problem
• Formulation of multiple-choice situations in linear programming models using binary coding matrices
• Multi-choice multi-objective linear programming problem

This page was built for publication: Generalized transformation techniques for multi-choice linear programming problems

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