99 results
Search Results
2. Can diverse and conflicting interests of multiple stakeholders be balanced?
3. On the extremal geometric–arithmetic graphs with fixed number of vertices having minimum degree
4. Limit laws for empirical optimal solutions in random linear programs
5. Bounding the values of financial derivatives by the use of the moment problem
6. Identifying relatively irreducible infeasible subsystems of linear inequalities
7. A linear programming primer: from Fourier to Karmarkar
8. Enhanced index tracking with CVaR-based ratio measures
9. Computing semi-stationary optimal policies for multichain semi-Markov decision processes
10. Robust vertex enumeration for convex hulls in high dimensions
11. Optimization of network redundancy and contingency planning in sustainable and resilient supply chain resource management under conditions of structural dynamics
12. A note on solving multi-objective integer indefinite quadratic fractional programs
13. LP-based tractable subcones of the semidefinite plus nonnegative cone
14. Markov decision processes and stochastic games with total effective payoff
15. Sharp bounds for the probability that exactly k-out-of-n events occur with unimodal distributions
16. Combinatorial redundancy detection
17. Data envelopment analysis and its related linear programming models
18. Robust auction design under multiple priors by linear and integer programming
19. An interactive algorithm to find the most preferred solution of multi-objective integer programs
20. A spatiotemporal Data Envelopment Analysis (S-T DEA) approach: the need to assess evolving units
21. Static target search path planning optimization with heterogeneous agents
22. Four proofs of Gittins’ multiarmed bandit theorem
23. A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering
24. A new rank dependent utility approach to model risk averse preferences in portfolio optimization
25. Distribution-dependent robust linear optimization with applications to inventory control
26. Exterior point simplex-type algorithms for linear and network optimization problems
27. Sensitivity analysis of gas supply optimization models
28. A characterization theorem and an algorithm for a convex hull problem
29. LP models for pricing diffuse nitrate discharge permits
30. Sustainable vegetable crop supply problem with perishable stocks
31. Application of Robust Optimization to the Sawmill Planning Problem
32. Interactive classification using data envelopment analysis
33. An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
34. Interdicting nuclear material on cargo containers using knapsack problem models
35. A recursive linear programming analysis of the future of the pulp and paper industry in the United States: Changes in supplies and demands, and the effects of recycling
36. Computing bounds for the probability of the union of events by different methods
37. Polynomial bases on the numerical solution of the multivariate discrete moment problem
38. Robust optimization analysis for multiple attribute decision making problems with imprecise information
39. Qualitative and quantitative data envelopment analysis with interval data
40. Analysis of stochastic problem decomposition algorithms in computational grids
41. A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty
42. A tactical model for planning the production and distribution of fresh produce
43. Linear programming and the inverse method of images
44. Scheduling preparation of doses for a chemotherapy service
45. Linear transformations to decrease computational requirements of solving some known linear programming models
46. Conditional value at risk and related linear programming models for portfolio optimization
47. Macaulay durations for nonparallel shifts
48. A MIP flow model for crop-rotation planning in a context of forest sustainable development
49. A Probe-Based Algorithm for Piecewise Linear Optimization in Scheduling
50. Solving Difficult Multicommodity Problems with a Specialized Interior-Point Algorithm
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.