Pages that link to "Item:Q4136967"

The following pages link to Lexicographic quasiconcave multiobjective programming (Q4136967):

Displaying 12 items.

• A local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functions (Q752006) (← links)
• Applications of fuzzy set theory to mathematical programming (Q1066822) (← links)
• On efficient sets in vector maximum problems - A brief survey (Q1068004) (← links)
• Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions (Q1080368) (← links)
• A simplex based algorithm for the lexicographically extended linear maxmin problem (Q1150307) (← links)
• Linear lexicographic optimization (Q1169408) (← links)
• Lexicographic geometric programming (Q1179204) (← links)
• On optimal decisions under complete ignorance. A new criterion stronger than both Pareto and Maxmin (Q1243258) (← links)
• Reducing the number of linear programs needed for solving the nucleolus problem of \(n\)-person game theory (Q1278742) (← links)
• Geometric methods to solve max-ordering location problems (Q1289016) (← links)
• Mechanism design in a supply chain with ambiguity in private information (Q2338475) (← links)
• A lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardiness (Q6164626) (← links)