Inverse optimization for linearly constrained convex separable programming problems
Authors:
- Jianzhong ZhangJZJianzhong Zhang
- Chengxian XuCXChengxian Xu
- 1 February 2010
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 200 (3) , 671-679
Abstract
No abstract availableThis publication has 44 references indexed in Scilit:
- Inverse conic programming with applicationsOperations Research Letters, 2005
- A Faster Algorithm for the Inverse Spanning Tree ProblemJournal of Algorithms, 2000
- A further study on inverse linear programming problemsJournal of Computational and Applied Mathematics, 1999
- Inverse problem of minimum cutsMathematical Methods of Operations Research, 1998
- Inverse maximum flow and minimum cut problemsOptimization, 1997
- Calculating some inverse linear programming problemsJournal of Computational and Applied Mathematics, 1996
- On the inverse problem of minimum spanning tree with partition constraintsMathematical Methods of Operations Research, 1996
- A nonlinear Knapsack problemOperations Research Letters, 1995
- A Model for Resource Constrained Production and Inventory ManagementDecision Sciences, 1994
- A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective FunctionJournal of the Operational Research Society, 1979