Pages that link to "Item:Q4042856"
From MaRDI portal
The following pages link to Parameter-free convex equivalent and dual programs of fractional programming problems (Q4042856):
Displayed 38 items.
- Measuring the efficiency of decision making units (Q76464) (← links)
- Robust fractional programming (Q493047) (← links)
- Robust duality for fractional programming problems with constraint-wise data uncertainty (Q658562) (← links)
- On robust duality for fractional programming with uncertainty data (Q743463) (← links)
- Complex fractional programming and the Charnes-Cooper transformation (Q813391) (← links)
- On the product line selection problem under attraction choice models of consumer behavior (Q976431) (← links)
- Foundations of data envelopment analysis for Pareto-Koopmans efficient empirical production functions (Q1068677) (← links)
- Classifying and characterizing efficiencies and inefficiencies in data development analysis (Q1084020) (← links)
- Pseudo-duality in mathematical programs with quotients and products (Q1135206) (← links)
- Fractional programming: Applications and algorithms (Q1148821) (← links)
- Equivalence between a generalized Fenchel duality theorem and a saddle- point theorem for fractional programs (Q1151834) (← links)
- Conjugate duality for fractional programs (Q1163482) (← links)
- Cost-effective allocations of bounded and binary resources in polynomial time (Q1168898) (← links)
- Allocation of resources according to a fractional objective (Q1243666) (← links)
- Convex dual for quadratic concave fractional programs (Q1359467) (← links)
- The problem of possibilistic-probabilistic optimization (Q1745858) (← links)
- On self-concordant barrier functions for conic hulls and fractional programming (Q1814792) (← links)
- Maximizing perturbation radii for robust convex quadratically constrained quadratic programs (Q2030501) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Robust sensitivity analysis for linear programming with ellipsoidal perturbation (Q2190327) (← links)
- Efficient formulations for pricing under attraction demand models (Q2248752) (← links)
- Parametric linear fractional programming for an unbounded feasible region (Q2366965) (← links)
- Suboptimal robust synthesis for MIMO plant under coprime factor perturbations (Q2481494) (← links)
- Iterative design of robust controllers under unknown bounded perturbation norms (Q2487578) (← links)
- Fractional programming with convex quadratic forms and functions (Q2496064) (← links)
- Optimising portfolio diversification and dimensionality (Q2679246) (← links)
- (Q3718492) (← links)
- Bibliography in fractional programming (Q3958287) (← links)
- Experiments with linear fractional problems (Q3960484) (← links)
- Generalization of some duality theorems in nonlinear programming (Q4132272) (← links)
- Comparison of duality models in fractional linear programming (Q4132277) (← links)
- Fractional programming without differentiability (Q4133419) (← links)
- Equivalence in linear fractional programming (Q4327875) (← links)
- (Q4917840) (← links)
- Efficient algorithms for solving nonlinear fractional programming problems (Q5080834) (← links)
- Rebalancing an investment portfolio in the presence of convex transaction costs, including market impact costs (Q5299910) (← links)
- On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints (Q5883323) (← links)
- An uncertain minimization problem: robust optimization versus optimization of robustness (Q6081597) (← links)