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

DOI10.1016/S0895-7177(01)00072-3zbMath1002.90064OpenAlexW2017645422MaRDI QIDQ5943367

Yong Shi, Yi-hua Zhong

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

interior-point methodefficient solution\(text{MC}^2\) linear programmingpotential solution

Mathematics Subject Classification ID

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

Related Items (1)

LINEAR PROGRAMMING MODELS WITH CHANGEABLE PARAMETERS — THEORETICAL ANALYSIS ON "TAKING LOSS AT THE ORDERING TIME AND MAKING PROFIT AT THE DELIVERY TIME"

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Potential solutions of linear systems: the multi-criteria multiple constraint levels program
• A new polynomial-time algorithm for linear programming
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• Weak duality theorem and complementary slackness theorem for linear matrix programming problems
• An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points
• An implementation of Karmarkar's algorithm for linear programming
• Linear Optimal Designs and Optimal Contingency Plans
• Anchoring Points and Cones of Opportunities in Interior Multiobjective Linear Programming
• Using Efficient Anchoring Points for Generating Search Directions in Interior Multiobjective Linear Programming

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