An interior-point approach for solving MC^2 linear programming problems

DOI10.1016/S0895-7177(01)00072-3MaRDI QIDQ5943367zbMATH OpenOpenAlexFDO

Authors Yi-hua Zhong, Yong Shi

Publication date 9 September 2001

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0895-7177(01)00072-3

zbMATH Keywords

\(text{MC}^2\) linear programmingefficient solutioninterior-point methodpotential solution

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Multi-objective and goal programming (90C29) Interior-point methods (90C51)

Recommendations

• A fuzzy programming approach for solving a multiple criteria and multiple constraint level linear programming problem
• Publication:4945552
• On the modified interior point algorithm for solving multi-objective linear programming problems
• A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems
• Computer-based algorithms for multiple criteria and multiple constraint level integer linear programming

Cites work

• A new polynomial-time algorithm for linear programming
• An implementation of Karmarkar's algorithm for linear programming
• An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points
• Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming
• scientific article; zbMATH DE number 3833720 (Why is no real title available?)
• scientific article; zbMATH DE number 3945836 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• Linear Optimal Designs and Optimal Contingency Plans
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• Potential solutions of linear systems: the multi-criteria multiple constraint levels program
• Using Efficient Anchoring Points for Generating Search Directions in Interior Multiobjective Linear Programming
• Weak duality theorem and complementary slackness theorem for linear matrix programming problems

Cited in

(2)

• A binary integer linear program with multi-criteria and multi-constraint levels
• LINEAR PROGRAMMING MODELS WITH CHANGEABLE PARAMETERS — THEORETICAL ANALYSIS ON "TAKING LOSS AT THE ORDERING TIME AND MAKING PROFIT AT THE DELIVERY TIME"

This page was built for publication: An interior-point approach for solving MC\(^2\) linear programming problems

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