Inverse optimization for linearly constrained convex separable programming problems
From MaRDI portal
Publication:1044084
DOI10.1016/j.ejor.2009.01.043zbMath1177.90321OpenAlexW2011964241MaRDI QIDQ1044084
Cheng-Xian Xu, Zhang, Jianzhong
Publication date: 10 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.01.043
Related Items
Inverse conic linear programs in Banach spaces, Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization, Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy, Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods, Inverse optimization with kernel regression: application to the power forecasting and bidding of a fleet of electric vehicles, Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection, Importance of verifying queue model assumptions before planning with simulation software, Data-driven inverse optimization with imperfect information, Trade-off preservation in inverse multi-objective convex optimization, Sparse portfolio rebalancing model based on inverse optimization, Inverse Optimization with Noisy Data, Hidden Markov models: inverse filtering, belief estimation and privacy protection, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch and search algorithm for a class of nonlinear knapsack problems
- An O(n) algorithm for quadratic knapsack problems
- Algorithms for the solution of quadratic knapsack problems
- A note on multi-item inventory systems with limited capacity
- Solving certain singly constrained convex optimization problems in production planning
- The relationship between integer and real solutions of constrained convex programming
- On an instance of the inverse shortest paths problem
- Local minima for indefinite quadratic knapsack problems
- On the continuous quadratic knapsack problem
- The practice of portfolio replication. A practical overview of forward and inverse problems
- Inverse problem of minimum cuts
- A further study on inverse linear programming problems
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- The nonlinear knapsack problem - algorithms and applications
- Inverse conic programming with applications
- A global optimization method for nonconvex separable programming problems
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Refined proximity and sensitivity results in linearly constrained convex separable integer programming
- A nonlinear knapsack problem
- Calculating some inverse linear programming problems
- On the solution of concave knapsack problems
- Constrained multi-item inventory systems: An implicit approach
- Algorithms for Separable Nonlinear Resource Allocation Problems
- Solving Inverse Spanning Tree Problems Through Network Flow Techniques
- The Inverse Newsvendor Problem: Choosing an Optimal Demand Portfolio for Capacitated Resources
- Reducing Separable Convex Programs with Tree Constraints
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- Inverse Optimization
- Optimal Lot Sizing, Process Quality Improvement and Setup Cost Reduction
- Simple Ranking Methods for Allocation of One Resource
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Technical Note—Allocation of Effort Resources among Competing Activities
- A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function
- Inverse maximum flow and minimum cut problems
- Combinatorial algorithms for inverse network flow problems
- A column generation method for inverse shortest path problems
- A Faster Algorithm for the Inverse Spanning Tree Problem
- Convex separable optimization is not much harder than linear optimization
- Convex separable minimization subject to bounded variables
