Pages that link to "Item:Q4136958"

The following pages link to Efficiency in multiple objective optimization problems (Q4136958):

Displaying 38 items.

• Geometric programming approach to an interactive fuzzy inventory problem (Q666413) (← links)
• Linear complementarity problems and multiple objective programming (Q689137) (← links)
• Efficiency in integral facility design problems (Q754778) (← links)
• Decision making under uncertainty: A semi-infinite programming approach (Q760341) (← links)
• Scalarizations for adaptively solving multi-objective optimization problems (Q849089) (← links)
• Variable preference modeling with ideal-symmetric convex cones (Q960117) (← links)
• Efficiency and proper efficiency in vector maximization with respect to cones (Q1055343) (← links)
• On efficient sets in vector maximum problems - A brief survey (Q1068004) (← links)
• Strong duality for infinite-dimensional vector-valued programming problems (Q1108942) (← links)
• An improved definition of proper efficiency for vector maximization with respect to cones (Q1131964) (← links)
• Differential games with nonzero sum (cooperative variant) (Q1156706) (← links)
• Admissible points of a convex polyhedron (Q1157772) (← links)
• Duality theory for maximizations with respect to cones (Q1159085) (← links)
• Ein Verfahren zur interaktiven Lösung nichtlinearer Vektoroptimierungsprobleme (Q1160568) (← links)
• Multiple-objective programming with polynomial objectives and constraints (Q1197675) (← links)
• Existence of efficient solutions for vector maximization problems (Q1245164) (← links)
• Optimization over the efficient set: Four special cases (Q1321439) (← links)
• Designing communication networks for distributed control agents. (Q1420380) (← links)
• An approximate strong KKT condition for multiobjective optimization (Q1617113) (← links)
• Second-order optimality conditions for multiobjective optimization whose order induced by second-order cone (Q1660295) (← links)
• Second-order optimality conditions for cone constrained multi-objective optimization (Q1717017) (← links)
• Robust multiobjective optimization with application to Internet routing (Q1730555) (← links)
• On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization (Q1935548) (← links)
• Retrieval and use of the balance set in multiobjective global optimization (Q1962989) (← links)
• Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications (Q2122022) (← links)
• An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
• An exact approach for the minimum-cost bounded-error calibration tree problem (Q2178300) (← links)
• A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem (Q2228402) (← links)
• A graphical characterization of the efficient set for convex multiobjective problems (Q2271819) (← links)
• Advancing equitability in multiobjective programming (Q2426019) (← links)
• Inverse multi-objective combinatorial optimization (Q2444572) (← links)
• Successive computation of some efficient locations of the Weber problem with barriers (Q2511354) (← links)
• An approximation method for the efficiency set of multiobjective programming problems (Q3211123) (← links)
• Efficiency in Multi-Objective Fractional Functional Programming (Q3964338) (← links)
• (Q5074081) (← links)
• Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors. (Q5929428) (← links)
• A generalized additive, categorical model in data envelopment analysis (Q5937141) (← links)
• On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)